Title :
Capacity-achieving sequences for the erasure channel
Author :
Oswald, Peter ; Shokrollaho, A.
Author_Institution :
Bell Labs., Lucent Technol., Murray Hill, NJ, USA
Abstract :
This paper starts a systematic study of capacity-achieving sequences of low-density parity-check codes for the erasure channel. We introduce a class A of analytic functions, show various useful properties of it, and develop a procedure to obtain degree distributions for the codes. We then study certain types of capacity-achieving sequences and introduce new measures for their optimality. For instance, it turns out that the right-regular sequence is capacity-achieving in a much stronger sense than, e.g., the Tornado sequence
Keywords :
channel capacity; channel coding; codes; optimisation; sequences; Tornado sequence; analytic functions; capacity-achieving sequences; degree distributions; erasure channel; low-density parity-check codes; optimality; right-regular sequence; Convergence; Decoding; Drives; H infinity control; Parity check codes; Taylor series; Tornadoes; Upper bound;
Conference_Titel :
Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on
Conference_Location :
Washington, DC
Print_ISBN :
0-7803-7123-2
DOI :
10.1109/ISIT.2001.935911
