Low-density parity-check codes with rates very close to the capacity of the q-ary symmetric channel for large q

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2004, Pages 275-

  Shokrollahi, Amin ^a   Wang, Wei ^b  

^a EPFL   (Switzerland)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIT-LEVEL ERRORS; DECODING ALGORITHMS; LOW-DENSITY PARITY-CHECK CODES;

ALGORITHMS; CHANNEL CAPACITY; COMMUNICATION CHANNELS (INFORMATION THEORY); DECODING; PACKET NETWORKS; POLYNOMIALS; PROBABILITY;

CODES (SYMBOLS);

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

References (2)

1. M. Luby and M. Mitzenmacher. Verification codes. Proc. Allerton Conf. on Communication, Control, and Computing, 2002.
2. M. Luby, M. Mitzenmacher, A. Shokrollahi, and D. Spielman. Efficient erasure correcting codes. IEEE Trans. Inform. Theory, 47:569-584, 2001.