RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 2017 Volume 53, Issue 1, Pages 3–33 (Mi ppi2224)

This article is cited in 4 papers

Information Theory

Some “goodness” properties of LDA lattices

S. Vatedka, N. Kashyap

Department of Electrical Communication Engineering, Indian Institute of Science, Bengaluru, India

Abstract: We study some structural properties of Construction-A lattices obtained from low density parity check codes over prime fields. Such lattices are called low density Construction-A (LDA) lattices, and permit low-complexity belief propagation decoding for transmission over Gaussian channels. It has been shown that LDA lattices achieve the capacity of the power constrained additive white Gaussian noise (AWGN) channel with closest lattice-point decoding, and simulations suggested that they perform well under belief propagation decoding. We continue this line of work and prove that these lattices are good for packing and mean squared error quantization and that their duals are good for packing. With this, we can conclude that codes constructed using nested LDA lattices can achieve the capacity of the power constrained AWGN channel, the capacity of the dirty paper channel, the rates guaranteed by the computeand-forward protocol, and the best known rates for bidirectional relaying with perfect secrecy.

UDC: 621.391.15

Received: 14.12.2015
Revised: 26.07.2016


 English version:
Problems of Information Transmission, 2017, 53:1, 1–29

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024