Error exponents of expander codes under linear-complexity decoding

SIAM Journal on Discrete Mathematics

Volumn 17, Issue 3, 2004, Pages 426-445

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

^a RUTGERS UNIVERSITY   (United States)

^b TELECOM PARISTECH   (France)

Author keywords

Elias radius; Error exponents; Expander codes; Iterative decoding

Indexed keywords

ELIAS RADIUS; ERROR EXPONENTS; EXPANDER CODES; ITERATIVE CODING;

ALGORITHMS; CHANNEL CAPACITY; CODES (SYMBOLS); DECODING; ERROR CORRECTION; ITERATIVE METHODS; POLYNOMIALS; PROBABILISTIC LOGICS; RANDOM PROCESSES; VECTORS;

LINEAR SYSTEMS;

EID: 4344660232     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480102403799     Document Type: Article

References (18)

1. A. BARG, Complexity issues in coding theory, in Handbook of Coding Theory, Vol. 1, V. Pless and W. C. Huffman, eds., Elsevier Science, Amsterdam, 1998, pp. 649-754.
2. A. BARG AND G. ZÉMOR, Error exponents of expander codes, IEEE Trans. Inform. Theory, 48 (2002), pp. 1725-1729.
3. A. BARG AND G. ZÉMOR, Concatenated codes: Serial and parallel, in Proceedings of the 2003 IEEE International Symposium on Information Theory, Yokohama, Japan, 2003, p. 465.
4. C. BERROU, A. GLAVIEUX, AND P. THITIMAJSHIMA, Near Shannon limit error-correcting coding and decoding, in Proceedings of the IEEE International Conference on Communication (ICC'93), Geneva, Switzerland, 1993, pp. 1064-1070.
5. E. L. BLOKH AND V. V. ZYABLOV, Linear Concatenated Codes, Nauka, Moscow, 1982 (in Russian).
6. L. DECREUSEFOND AND G. ZÉMOR, On the error-correcting capabilities of cycle codes of graphs, Combin. Probab. Comput., 6 (1997), pp. 27-38.
7. I. DUMER, Concatenated codes and their multilevel generalizations, in Handbook of Coding Theory, Vol. 2, V. Pless and W. C. Huffman, eds., Elsevier Science, Amsterdam, 1998, pp. 1911-1988.
8. P. ELIAS, Coding for noisy channels, in IRE Conv. Rec., 1955, pp. 37-46. Reprinted in Key Papers in the Development of Information Theory, D. Slepian, ed., IEEE Press, New York, 1974, pp. 102-111.
9. P. ELIAS, Coding for noisy channels, in IRE Conv. Rec., 1955, pp. 37-46. Reprinted in Key Papers in the Development of Information Theory, D. Slepian, ed., IEEE Press, New York, 1974, pp. 102-111.
10. G. D. FORNEY, JR., Concatenated Codes, MIT Press, Cambridge, MA, 1966.
11. R. G. GALLAGER, Low-Density Parity-Check Codes, MIT Press, Cambridge, MA, 1963.
12. R. G. GALLAGER, Information Theory and Reliable Communication, John Wiley and Sons, New York, 1968.
13. V. GURUSWAMI AND P. INDYK, Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets, in Proceedings of the 34th ACM Symposium on the Theory of Computing (STOC'02), Montreal, QC, Canada, 2002, pp. 812-821.
14. A. LUBOTZKY, R. PHILLIPS, AND P. SARNAK, Ramanujan graphs, Combinatorica, 8 (1988), pp. 261-277.
15. G. A. MARGULIS, Explicit constructions of graphs without short cycles and low density codes, Combinatorica, 2 (1982), pp. 71-78.
16. M. SIPSER AND D. A. SPIELMAN, Expander codes, IEEE Trans. Inform. Theory, 42 (1996), pp. 1710-1722.
17. M. TANNER, A recursive approach to low-complexity codes, IEEE Trans. Inform. Theory, 27 (1981), pp. 533-547.
18. G. ZÉMOR, On expander codes, IEEE Trans. Inform. Theory, 47 (2001), pp. 835-837.