The achievement of Poltyrev exponent by lattice decoded nested codes was discussed. Results showed that lattice codes can achieve this capacity using lattice decoding. This analysis can be refined to the random coding error exponent and can provide a construction for nested lattice codes.
|Number of pages||1|
|Journal||IEEE International Symposium on Information Theory - Proceedings|
|State||Published - 2002|
|Event||2002 IEEE International Symposium on Information Theory - Lausanne, Switzerland|
Duration: 30 Jun 2002 → 5 Jul 2002