Concatenated codes: Serial and parallel

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2003, Pages 465-

  Barg, Alexander ^a   Zémor, Gilles ^b  

^a Center for Discrete Mathematics and Theoretical Computer Science   (United States)

^b TELECOM PARISTECH   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY CODES; CODING ERRORS; DECODING; EIGENVALUES AND EIGENFUNCTIONS; ERROR ANALYSIS; GRAPHIC METHODS; SET THEORY; VECTORS;

BINARY SYMMETRIC CHANNEL; CONCATENATED CODES; ERROR EXPONENTS; SPHERE PACKING BOUND;

INFORMATION THEORY;

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

References (6)

1. G. D. Forney, Jr., Concatenated codes, MIT Press, Cambridge, MA, 1966.
2. M. Tanner, "A recursive approach to low-complexity codes," IEEE Trans. Inform. Theory 27 (1981), no. 5, 1710-1722.
3. G. Zémor, "On expander codes," IEEE Trans. Inform. Theory 47 (2001), no. 2, 835-837.
4. M. Sipser and D. A. Spielman, "Expander codes," IEEE Trans. Inform. Theory 42 (1996), no. 6, 1710-1722.
5. A. Barg and G. Zémo, "Error exponents of expander codes," IEEE Trans. Inform. Theory 48 (2002), no. 6, 1725-1729.
6. A. Barg and G. Zémor, Error exponents of expander codes under linear-complexity decoding, DIMACS Report 2002-32 (http://dimacs.rutgers.edu/TechnicalReports).