Lattice codes can achieve capacity on the AWGN channel
Authors:
- R. UrbankeRUR. Urbanke
- B. RimoldiBRB. Rimoldi
- 1 January 1998
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 44 (1) , 273-278
Abstract
It is shown that lattice codes can achieve capacity on the additive white Gaussian noise channel. More precisely, for any rate less than capacity and , there exists a lattice code with rate no less than and average error probability upper-bounded by These lattice codes include all points of the (translated) lattice within the spherical bounding region (not just the ones inside a thin spherical shell).Keywords
This publication has 8 references indexed in Scilit:
- Averaging bounds for lattices and linear codesIEEE Transactions on Information Theory, 1997
- On the Basic Averaging Arguments for Linear Codes1994
- Corrected proof of de Buda's theorem (lattice channel codes)IEEE Transactions on Information Theory, 1993
- Geometric and Analytic Number Theory1991
- Some optimal codes have structureIEEE Journal on Selected Areas in Communications, 1989
- The upper error bound of a new near-optimal codeIEEE Transactions on Information Theory, 1975
- Coding Theorems of Information Theory1964
- Probability of Error for Optimal Codes in a Gaussian ChannelBell System Technical Journal, 1959