Construction and Lattices: Construction, Goodness, and Decoding Algorithms
arXiv:1506.08269
Abstract
A novel construction of lattices is proposed. This construction can be thought of as a special class of Construction A from codes over finite rings that can be represented as the Cartesian product of linear codes over , respectively, and hence is referred to as Construction . The existence of a sequence of such lattices that is good for channel coding (i.e., Poltyrev-limit achieving) under multistage decoding is shown. A new family of multilevel nested lattice codes based on Construction lattices is proposed and its achievable rate for the additive white Gaussian channel is analyzed. A generalization named Construction is also investigated which subsumes Construction A with codes over prime fields, Construction D, and Construction as special cases.
arXiv comment26 pages, 11 figures. arXiv admin note: text overlap with arXiv:1401.2228
References in corpus (8)
- The Approximate Capacity of the Many-to-One and One-to-Many Gaussian Interference Channels
- On the role of MMSE estimation in approaching the information-theoretic limits of linear Gaussian channels: Shannon meets Wiener
- Lattice Index Coding
- Construction of Capacity-Achieving Lattice Codes: Polar Lattices
- Value distribution of Ramanujan sums and of cyclotomic polynomial coefficients
- Polar Lattices for Lossy Compression
- Message-Passing Decoding of Lattices Using Gaussian Mixtures
- Lattices from Codes for Harnessing Interference: An Overview and Generalizations