Title :
On the complexity of reliable communication on the erasure channel
Author :
Khandekar, Aamod ; Mceliece, Robert J.
Author_Institution :
California Inst. of Technol., Pasadena, CA, USA
Abstract :
We discuss the complexity of achieving channel capacity on the binary erasure channel (BEC) in view of recent advances. We also extrapolate to conjecture complexity bounds on more general channels
Keywords :
channel capacity; channel coding; communication complexity; decoding; telecommunication channels; binary erasure channel; channel capacity; complexity bounds; reliable communication; Channel capacity; Channel coding; Equations; Error probability; Iterative decoding; Linear code; Maximum likelihood decoding; Memoryless systems; Parity check codes; Turbo codes;
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.935864
