Published June 2000
| public
Book Section - Chapter
AWGN Coding Theorems from Ensemble Weight Enumerators
- Creators
- Divsalar, D.
- Dolinar, S.
- Jin, H.
- McEliece, R.
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 E_b/N_0>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.
Additional Information
© 2000 IEEE. Date of Current Version: 06 August 2002. The work of these authors was supported the National Aeronautics and Space Administration. The work of these authors was supported by NSF grant no. CCR-9804793, and grants form Sony and Qualcomm.Additional details
- Eprint ID
- 27957
- Resolver ID
- CaltechAUTHORS:20111128-074933357
- NASA
- CCR-9804793
- NSF
- Sony
- Qualcomm
- Created
-
2011-11-28Created from EPrint's datestamp field
- Updated
-
2021-11-09Created from EPrint's last_modified field
- Other Numbering System Name
- INSPEC Accession Number
- Other Numbering System Identifier
- 6794322