Information-theoretic lower bounds on the bit error probability of codes on graphs

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2003, Pages 268-

  Sason, Igal ^a   Urbanke, Rüdiger ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY CODES; BIT ERROR RATE; BLOCK CODES; CHANNEL CAPACITY; COMPUTATIONAL COMPLEXITY; DECODING; ERROR CORRECTION; GRAPH THEORY; MATRIX ALGEBRA; MAXIMUM LIKELIHOOD ESTIMATION; PROBABILITY;

BINARY ERASURE CHANNEL; BINARY LINEAR BLOCK CODES; BIPARTITE GRAPHS; BIT ERROR PROBABILITY; LOW DENSITY PARITY CHECK; MEMORYLESS BINARY INPUT OUTPUT SYMMETRIC CHANNELS;

INFORMATION THEORY;

EID: 0141938903     PISSN: 21578096     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/isit.2003.1228283     Document Type: Conference Paper

References (4)

1. T. Etzion, A. Trachtenberg and A. Vardy, "Which codes have cycle-free Tanner graphs?," IEEE Trans. on Information Theory, vol. 45, no. 6, pp. 2173-2181, September 1999.
2. A. Khandekar and R. J. McEliece, "On the complexity of reliable communications on the erasure channel", Proceedings ISIT 2001, p. 1, Washington, D.C., June 24-29, 2001.
3. I. Sason and R. Urbanke, "Parity-check density versus performance of binary linear codes over memoryless symmetric channels," to appear in IEEE Trans. on Information Theory. [Online]. Available: http://lthiwww.epfl.ch/~eeigal.
4. A. Shokrollahi, "New sequences of time erasure codes approaching channel capacity," Proceedings 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Lecture Notes in Computer Science 1179, Springer Verlag, pp. 65-76, 1999.