New Results on Low-Density Integer Lattices
Conference Paper
Overview
Identity
Additional Document Info
Other
View All
Overview
abstract
A new family of integer lattices built from Construction A and non-binary low-density parity-check (LDPC) codes has been proposed by the authors in 2012. Lattices in this family are referred to as LDA lattices. Previous experimental results revealed excellent performance which clearly single out LDA lattices among the strongest candidates for potential applications in digital communications and networks, such as network coding and information theoretic security at the physical layer level. In this paper, we show that replacing random codes by LDPC codes in Construction A does not induce any structural loss. More precisely, our main theorem states that LDA lattices can achieve Poltyrev capacity limit on an additive white Gaussian noise channel. We present here the detailed proof and its consequences on the lattice dimension, the finite field size, and the parameters of the LDPC ensemble. The latter has a row weight that increases logarithmically in the code length. In a more recent work, it is proved that the Poltyrev limit is attained by a different LDA ensemble having a small constant row weight. 2013 IEEE.
name of conference
2013 Information Theory and Applications Workshop (ITA)
