Cycle Tanner-graph codes over GF(2b)

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2003, Pages 87-

  Hu, Xiao Yu ^a   Eleftheriou, Evangelos ^a  

^a IBM RESEARCH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY INPUT CHANNELS; CYCLE TANNER GRAPH CODES; ITERATIVE DECODING; LOW DENSITY PARITY CHECK CODES; SHANNON LIMIT;

ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); DECODING; ERROR CORRECTION; GAUSSIAN NOISE (ELECTRONIC); GRAPH THEORY; MATRIX ALGEBRA; WHITE NOISE;

BINARY CODES;

EID: 0141904729     PISSN: 21578096     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (3)

1. M. C. Davey and D. MacKay, "Low-density parity-check codes over GF(q)," IEEE Commun. Lett., vol. 2, no. 6, pp. 165-167, June 1998.
2. X.-Y. Hu, E. Eleftheriou and D.-M. Arnold, "Progressive edge-growth Tanner graphs," Proc. IEEE Global Telecommun. Conf. (GLOBECOM), San Antonio, Texas, USA, Nov. 2001.
3. X.-Y. Hu, "Low-delay low-complexity error-correcting codes on sparse graphs," Ph.D. thesis, Swiss Federal Institute of Technology Lausanne (EPFL), Switzerland, Oct. 2002.