Title :
AWGN coding theorems from ensemble weight enumerators
Author :
Divsalar, D. ; Dolinar, S. ; Jin, H. ; McEliece, R.
Author_Institution :
Jet Propulsion Lab., California Inst. of Technol., Pasadena, CA, USA
Abstract :
We develop AWGN coding theorems for ensembles of codes for which we can calculate, or at least closely estimate, the ensemble weight enumerator. As a rule, for such an ensemble we can find a threshold c such that if Eb/N0>c, then the ensemble maximum-likelihood error probability approaches zero. This threshold is always better, and usually much better, than can be obtained from the union bound. The role of low-weight code words is the key
Keywords :
AWGN channels; channel coding; codes; error statistics; iterative decoding; maximum likelihood decoding; AWGN channel; AWGN coding theorems; Divsalar threshold; ensemble weight enumerators; iterative message-passing algorithms; low-weight code words; maximum-likelihood decoding; maximum-likelihood error probability; union bound; AWGN channels; Iterative algorithms; Iterative decoding; Kilns; Laboratories; Linear code; Maximum likelihood decoding; Maximum likelihood estimation; Parity check codes; Propulsion;
Conference_Titel :
Information Theory, 2000. Proceedings. IEEE International Symposium on
Conference_Location :
Sorrento
Print_ISBN :
0-7803-5857-0
DOI :
10.1109/ISIT.2000.866757
