A Caltech Library Service

AWGN Coding Theorems from Ensemble Weight Enumerators

Divsalar, D. and Dolinar, S. and Jin, H. and McEliece, R. (2000) AWGN Coding Theorems from Ensemble Weight Enumerators. In: 2000 IEEE International Symposium on Information Theory. IEEE , Piscataway, N.J., p. 459. ISBN 0-7803-5858-9.

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item:


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.

Item Type:Book Section
Related URLs:
URLURL TypeDescription
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.
Funding AgencyGrant Number
Other Numbering System:
Other Numbering System NameOther Numbering System ID
INSPEC Accession Number6794322
Record Number:CaltechAUTHORS:20111128-074933357
Persistent URL:
Official Citation:Divsalar, D.; Dolinar, S.; Jin, H.; McEliece, R.; , "AWGN coding theorems from ensemble weight enumerators," Information Theory, 2000. Proceedings. IEEE International Symposium on , vol., no., pp.459, 2000 doi: 10.1109/ISIT.2000.866757 URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:27957
Deposited By: Ruth Sustaita
Deposited On:28 Nov 2011 16:17
Last Modified:09 Nov 2021 16:53

Repository Staff Only: item control page