Some ``good properties of LDA lattices
From MaRDI portal
Publication:1752293
DOI10.1134/S003294601701001XzbMath1387.94052arXiv1410.7619OpenAlexW1778583390MaRDI QIDQ1752293
Publication date: 24 May 2018
Published in: Problems of Information Transmission (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1410.7619
Cites Work
- Unnamed Item
- Unnamed Item
- Asymptotically optimal switching circuits
- On the complexity of an optimal non-blocking commutation scheme without reorganization
- A Simple Proof for the Existence of “Good” Pairs of Nested Lattices
- 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
- Expander codes
- Lattice Coding for Signals and Networks
- Modern Coding Theory
- Expander graphs and their applications
- Lattices Which Are Good for (Almost) Everything
- Capacity and Lattice Strategies for Canceling Known Interference
- Achieving<tex>$ 1over 2log (1+ hboxSNR)$</tex>on the AWGN Channel With Lattice Encoding and Decoding
- Low-Density Lattice Codes
- On coding without restrictions for the AWGN channel
- LDA Lattices Without Dithering Achieve Capacity on the Gaussian Channel
- Compute-and-Forward: Harnessing Interference Through Structured Codes
- Joint Physical Layer Coding and Network Coding for Bidirectional Relaying
- The Approximate Capacity of the Many-to-One and One-to-Many Gaussian Interference Channels
- Generalized Degrees of Freedom of the Symmetric Gaussian $K$ User Interference Channel
- On the geometry of numbers
This page was built for publication: Some ``good properties of LDA lattices
