Abstract
In 1973, Gallager proved that the random-coding bound is exponentially tight for the random code ensemble at all rates, even below expurgation. This result explained that the random-coding exponent does not achieve the expurgation exponent due to the properties of the random ensemble, irrespective of the utilized bounding technique. It has been conjectured that this same behavior holds true for a random ensemble of linear codes. This conjecture is proved in this paper. In addition, it is shown that this property extends to Poltyrev's random-coding exponent for a random ensemble of lattices.
| Original language | English |
|---|---|
| Article number | 7312995 |
| Pages (from-to) | 121-130 |
| Number of pages | 10 |
| Journal | IEEE Transactions on Information Theory |
| Volume | 62 |
| Issue number | 1 |
| DOIs | |
| State | Published - 1 Jan 2016 |
Keywords
- Code ensembles
- Error exponent
- Lattices
- Linear codes
- Lower bounding techniques
- Random-coding