Nested linear/lattice codes revisited
From MaRDI portal
Publication:2658398
DOI10.1007/978-3-030-61303-7_7zbMath1478.94146OpenAlexW3120063243MaRDI QIDQ2658398
Publication date: 22 March 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-61303-7_7
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- A Simple Proof for the Existence of “Good” Pairs of Nested Lattices
- An Achievable Rate Region for the Three-User Interference Channel Based on Coset Codes
- Secure Compute-and-Forward in a Bidirectional Relay
- Real Interference Alignment: Exploiting the Potential of Single Antenna Systems
- Secure Degrees of Freedom of One-Hop Wireless Networks
- The Approximate Sum Capacity of the Symmetric Gaussian <inline-formula> <tex-math notation="TeX">$K$ </tex-math></inline-formula>-User Interference Channel
- Degrees of Freedom of Two-Hop Wireless Networks: Everyone Gets the Entire Cake
- Distributed Compression of Linear Functions: Partial Sum-Rate Tightness and Gap to Optimal Sum-Rate
- Providing Secrecy With Structured Codes: Two-User Gaussian Channels
- The Degrees of Freedom of Compute-and-Forward
- Ramanujan Primes and Bertrand's Postulate
- Network Information Theory
- Lattice Coding for Signals and Networks
- Some optimal codes have structure
- Achieving<tex>$ 1over 2log (1+ hboxSNR)$</tex>on the AWGN Channel With Lattice Encoding and Decoding
- Coset codes. I. Introduction and geometrical classification
- Coset codes. II. Binary lattices and related codes
- The upper error bound of a new near-optimal code
- How to encode the modulo-two sum of binary sources (Corresp.)
- Corrected proof of de Buda's theorem (lattice channel codes)
- On coding without restrictions for the AWGN channel
- Averaging bounds for lattices and linear codes
- Lattice codes can achieve capacity on the AWGN channel
- A Joint Typicality Approach to Compute–Forward
- An Achievable Rate Region Based on Coset Codes for Multiple Access Channel With States
- LDA Lattices Without Dithering Achieve Capacity on the Gaussian Channel
- Achievable Rate Region for Three User Discrete Broadcast Channel Based on Coset Codes
- Nested linear/lattice codes for structured multiterminal binning
- Lattices for Distributed Source Coding: Jointly Gaussian Sources and Reconstruction of a Linear Function
- Algebraic Coding Theory
- Compute-and-Forward: Harnessing Interference Through Structured Codes
- Distributed Source Coding Using Abelian Group Codes: A New Achievable Rate-Distortion Region
- On Distributed Compression of Linear Functions
- 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
- Hash property and coding theorems for sparse matrices and maximum-likelihood coding
- Compute-and-Forward Strategies for Cooperative Distributed Antenna Systems
- Interference Alignment: From Degrees of Freedom to Constant-Gap Capacity Approximations
- Lattice Codes for the Gaussian Relay Channel: Decode-and-Forward and Compress-and-Forward
- Elements of Information Theory
This page was built for publication: Nested linear/lattice codes revisited
