Title :
A comparison of known codes, random codes, and the best codes
Author :
MacMullan, Samuel J. ; Collins, Oliver M.
Author_Institution :
Lincoln Lab., MIT, Lexington, MA, USA
Abstract :
This paper calculates new bounds on the size of the performance gap between random codes and the best possible codes on the binary symmetric channel (BSC), binary erasure channel (BEC), and the additive white Gaussian noise (AWGN) channel. The paper also presents substantial numerical evaluation of the performance of random codes and existing standard lower bounds for the BEC, BSC, and the AWGN channel. These results provide a useful standard against which to measure many popular codes including turbo codes, e.g., there exist turbo codes that perform within 0.6 dB of the bounds over a wide range of block lengths
Keywords :
AWGN channels; BCH codes; Hamming codes; block codes; error statistics; random codes; turbo codes; AWGN channel; additive white Gaussian noise; best possible codes; binary erasure channel; binary symmetric channel; block length; known codes; numerical evaluation; random codes; sphere packing lower bound; AWGN channels; Additive white noise; Capacity planning; Channel capacity; Code standards; Delay; Error probability; Laboratories; Phase shift keying; Turbo codes;
Conference_Titel :
Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Conference_Location :
Cambridge, MA
Print_ISBN :
0-7803-5000-6
DOI :
10.1109/ISIT.1998.708819
