Codes defined on graphs

IEEE Communications Magazine

Volumn 41, Issue 8, 2003, Pages 118-125

  Kschischang, Frank R ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CHANNEL CAPACITY; COMPUTATIONAL COMPLEXITY; DECODING; ERROR CORRECTION; GRAPH THEORY; LINEAR EQUATIONS; PROBABILITY DISTRIBUTIONS;

ERROR CORRECTING CODES; HAMMING CODE; ITERATIVE DECODING; LOW DENSITY PARITY CHECK CODES; SUM-PRODUCT ALGORITHM;

TURBO CODES;

EID: 0042921166     PISSN: 01636804     EISSN: None     Source Type: Journal    
DOI: 10.1109/MCOM.2003.1222727     Document Type: Article

References (14)

1. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon Limit Error-correcting Coding and Decoding: Turbo Codes," Proc. 1993 IEEE ICC, Geneva, Switzerland, May 1993, pp. 1064-70.
2. IEEE Trans. Info. Theory, vol. 47, no. 2, Special Issue on Codes on Graphs and Iterative Algorithms, Feb. 2001.
3. F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, "Factor Graphs and the Sum-Product Algorithm," IEEE Trans. Info. Theory, vol. 47, Feb. 2001, pp. 498-519.
4. R. M. Tanner, "A Recursive Approach to Low Complexity Codes," IEEE Trans. Info. Theory, vol. IT-27, Sept. 1981, pp. 533-47.
5. N. Wiberg, H.-A. Loeliger, and R. Koetter, "Codes and Iterative Decoding on General Graphs," Euro. Trans. Telecommun., vol. 6, Sept./Oct. 1995, pp. 513-25.
6. N. Wiberg, "Codes and Decoding on General Graphs," Ph.D. dissertation, Linköping Univ., Dept. of Elec. Eng., 1996.
7. R. J. McEliece, D. J. C. MacKay, and J.-F. Cheng, "Turbo Decoding as an Instance of Pearl's 'Belief Propagation' Algorithm," IEEE JSAC, vol. 16, Feb. 1998, pp. 140-52.
8. F. R. Kschischang and B. J. Frey, "Iterative Decoding of Compound Codes by Probability Propagation in Graphical Models," IEEE JSAC, vol. 16, Feb. 1998, pp. 219-30.
9. L. R. Bahl et al., "Optimal Decoding of Linear Codes for Minimizing Symbol Error Rate," IEEE Trans. Info. Theory, vol. IT-20, Mar. 1974, pp. 284-87.
10. T. J. Richardson and R. L. Urbanke, "The Capacity of Low-Density Parity-Check Codes Under Message-Passing Decoding," IEEE Trans. Info. Theory, vol. 47, Feb. 2001, pp. 599-618.
11. S.-Y. Chung et al., "On the Design of Low-Density Parity-Check Codes within 0.0045 dB of the Shannon Limit," IEEE Commun. Lett., vol. 5, Feb. 2001, pp. 58-60.
12. S. ten Brink, "Convergence Behavior of Iteratively Decoded Parallel Concatenated Codes," IEEE Trans. Commun., vol. 49, Oct. 2001, pp. 1727-37.
13. A. P. Worthen and W. E. Stark, "Unified Design of Iterative Receivers Using Factor Graphs," IEEE Trans. Info. Theory, vol. 47, Feb. 2001, pp. 843-49.
14. J. Boutros and G. Caire, "Iterative Multiuser Joint Decoding: Unified Framework and Asymptotic Analysis," IEEE Trans. Info. Theory, vol. 48, July 2002, pp. 1772-93.