Capacity-achieving sequences for the erasure channel

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2001, Pages 48-

  Oswald, P ^a   Shokrollahi, A ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CAPACITY-ACHIEVING SEQUENCES; ERASURE CHANNEL; EULER CONSTANT; PARITY CHECK CODES; SHANNON CAPACITY; TORNADO SEQUENCES;

ALGORITHMS; ASYMPTOTIC STABILITY; CODES (SYMBOLS); COMMUNICATION CHANNELS (INFORMATION THEORY); CONVERGENCE OF NUMERICAL METHODS; DECODING; GRAPH THEORY; OPTIMIZATION; PROBABILITY DISTRIBUTIONS; SET THEORY;

CHANNEL CAPACITY;

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

References (5)

1. Analysis of low density codes and improved designs using irregular graphs
2. The capacity of low-density parity check codes under message-passing decoding
3. Design of capacity-approaching irregular low-density parity-check codes
4. Practical loss-resilient codes
5. New sequences of linear time erasure codes approaching the channel capacity