Some ``good properties of LDA lattices
From MaRDI portal
Publication:1752293
Abstract: We study some structural properties of Construction-A lattices obtained from low density parity check (LDPC) 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 (MSE) 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 compute-and-forward protocol, and the best known rates for bidirectional relaying with perfect secrecy.
Recommendations
- Lattices Which Are Good for (Almost) Everything
- scientific article; zbMATH DE number 1322687
- scientific article; zbMATH DE number 67199
- Publication:4940309
- Good low degree rank-1 lattice rules of high dimension
- scientific article; zbMATH DE number 969514
- Some interesting behaviors of good lattice point sets
- Some properties of graphs derived from lattices
- Some properties on derivations of lattices
- Some properties of lattice homomorphisms
Cites work
- A Simple Proof for the Existence of “Good” Pairs of Nested Lattices
- Achieving<tex>$ 1over 2log (1+ hboxSNR)$</tex>on the AWGN Channel With Lattice Encoding and Decoding
- Asymptotically optimal switching circuits
- Capacity and Lattice Strategies for Canceling Known Interference
- Compute-and-Forward: Harnessing Interference Through Structured Codes
- Expander codes
- Expander graphs and their applications
- Generalized Degrees of Freedom of the Symmetric Gaussian K User Interference Channel
- scientific article; zbMATH DE number 192896 (Why is no real title available?)
- scientific article; zbMATH DE number 3282420 (Why is no real title available?)
- Joint Physical Layer Coding and Network Coding for Bidirectional Relaying
- Lattice coding for signals and networks. A structured coding approach to quantization, modulation, and multiuser information theory. With contributions by Bobak Nazer and Yuval Kochman
- Lattices Which Are Good for (Almost) Everything
- LDA Lattices Without Dithering Achieve Capacity on the Gaussian Channel
- Low-Density Lattice Codes
- Modern Coding Theory
- On coding without restrictions for the AWGN channel
- On the complexity of an optimal non-blocking commutation scheme without reorganization
- On the geometry of numbers
- Secure Compute-and-Forward in a Bidirectional Relay
- Semantically Secure Lattice Codes for the Gaussian Wiretap Channel
- Strong Secrecy and Reliable Byzantine Detection in the Presence of an Untrusted Relay
- The Approximate Capacity of the Many-to-One and One-to-Many Gaussian Interference Channels
Cited in
(5)- Multilevel lattices for compute-and-forward and lattice network coding
- Lattices Which Are Good for (Almost) Everything
- Achieving<tex>$ 1over 2log (1+ hboxSNR)$</tex>on the AWGN Channel With Lattice Encoding and Decoding
- On coding without restrictions for the AWGN channel
- scientific article; zbMATH DE number 1456827 (Why is no real title available?)
This page was built for publication: Some ``good properties of LDA lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1752293)
