Capacity-approaching codes on the q-ary symmetric channel for large q

2004 IEEE Information Theory Workshop - Proceedings, ITW

Volumn , Issue , 2004, Pages 204-208

  Shokrollahi, Amin ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CHANNEL CAPACITY; CODES (SYMBOLS); DIFFERENTIAL EQUATIONS; ERROR ANALYSIS; FUNCTIONS; PACKET NETWORKS; POLYNOMIALS; PROBABILITY;

BELIEF-PROPOGATION ALGORITHMS; CAPACITY-APPROACHING CODES; ERASURE CORRECTION; Q-ARY SYMMETRIC CHANNELS;

COMMUNICATION CHANNELS (INFORMATION THEORY);

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

References (8)

1. D. Bleichenbacher, A. Kiyayias, and M. Yung. Decoding of interleaved Reed-Solomon codes over noisy data. In Proceedings of ICALP 2003, pages 97-108, 2003.
2. A. Brown, L. Minder, and A. Shokrollahi. Probabilistic decoding of interleaved RS-codes on the Q-ary symmetric channel. In Proceedings of the 2004 IEEE ISIT, pp. 327, 2004.
3. D. Divsalar, H. Jin, and R. McEliece. Coding theorems for Turbo-like' codes. In Proceedings of the 1998 Allerton Conference, pp. 201-210, 1998.
4. R. Gopalan, R. Lipton, and Y.Z. Ding. Code, adversaries, and information: a computational approach. Submitted, 2001.
5. M. Luby and M. Mitzenmacher. Verification codes. In Proceedings of the 40th Annual Allerton Conference on Communication, Control, and Computing, 2002.
6. M. Luby, M. Mitzenmacher, A. Shokrollahi, and D. Spielman. Efficient erasure correcting codes. IEEE Trans. Inform. Theory, 47:569-584, 2001.
7. H.D. Pfister, I. Sason, and R. Urbanke. Capacity-achieving ensembles for the binary erasure channel with bounded complexity. Preprint, 2004.
8. A. Shokrollahi and W. Wang. LDPC codes with rates very close to the capacity of the g-ary symmetric channel for large q. In Proceedings of the 2004 IEEE ISIT, pp. 275, 2004.