On graphical representations of algebraic codes suitable for iterative decoding

IEEE Communications Letters

Volumn 9, Issue 8, 2005, Pages 729-731

  Kumar, Vidya ^a   Milenkovic, Olgica ^a  

^a UCB 450   (United States)

Author keywords

Algebraic codes; Four cycles; Iterative decoding

Indexed keywords

COMPUTER SIMULATION; DECODING; GRAPH THEORY; ITERATIVE METHODS; MATRIX ALGEBRA;

ALGEBRAIC CODES; FOUR CYCLES; ITERATIVE DECODING;

CODES (SYMBOLS);

EID: 27644543256     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/LCOMM.2005.1496597     Document Type: Article

References (4)

1. m) and companion matrix based decoding," in Proc. ISIT'2004, p. 274, June 2004.
2. S. Sankaranarayanan and B. Vasic, "Analysis of iterative erasure-decoding of linear block codes: a parity-check orthogonalization approach," in Proc. 42nd Annual Allerton Conference on Communication, Control, and Computing, pp. 1682-1691, Sept. 2004.
3. A. Vardy and Y. Be'ery, "Bit level soft decoding of reed solomon codes," IEEE Trans. Inform. Theory, vol. 39, pp. 440-444, Mar. 1991.
4. J. Yedidia, J. Chen, and M. Fossorier, "Generating code representations suitable for belief propagation decoding," in Proc. 40th Allerton Conference on Communication, Control and Computing, pp. 447-456, Oct. 2002.