Improving the Performance of Nested Lattice Codes Using Concatenation

No abstract is available for this paper.

• Publication year

  2016

• Venue

  arXiv: Information Theory

• Publication date

  2016-03-27

• Fields of study

  Mathematics, Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• LDA Lattices Without Dithering Achieve Capacity on the Gaussian Channel

  2016cited by this paper
• A lattice coding scheme for secret key generation from Gaussian Markov tree sources

  2016cited by this paper
• Unified Scaling of Polar Codes: Error Exponent, Scaling Exponent, Moderate Deviations, and Error Floors

  2015cited by this paper
• Capacity-achieving Sparse Regression Codes via approximate message passing decoding

  2015cited by this paper
• Lattice Coding for Signals and Networks: A Structured Coding Approach to Quantization, Modulation and Multiuser Information Theory

  2014influential reference
• Explicit capacity-achieving coding scheme for the Gaussian wiretap channel

  2014cited by this paper
• Fast Sparse Superposition Codes Have Near Exponential Error Probability for $R<{\cal C}$

  2014cited by this paper
• Lattice Coding for Signals and Networks: A Structured Coding Approach to Quantization, Modulation and Multiuser Information Theory

  2014influential reference
• Interlacing Families I: Bipartite Ramanujan Graphs of All Degrees

  2013cited by this paper
• Semantically Secure Lattice Codes for the Gaussian Wiretap Channel

  2012cited by this paper
• Physical-Layer Security: From Information Theory to Security Engineering

  2011cited by this paper
• Physical-layer network coding: Tutorial, survey, and beyond

  2011cited by this paper
• Least squares superposition codes of moderate dictionary size, reliable at rates up to capacity

  2010cited by this paper
• Construction of turbo lattices

  2010cited by this paper
• Integer-forcing linear receivers

  2010cited by this paper
• Compute-and-Forward: Harnessing Interference Through Structured Codes

  2009cited by this paper
• Low Density Lattice Codes

  2006cited by this paper
• Low-Density Parity-Check Lattices: Construction and Decoding Analysis

  2006cited by this paper
• A Mathematical Theory of Communication

  2006cited by this paper
• Multilevel expander codes

  2005cited by this paper
• Concatenated codes: serial and parallel

  2003cited by this paper
• The State of Elliptic Curve Cryptography

  2000cited by this paper
• Lattice codes can achieve capacity on the AWGN channel

  1995cited by this paper
• Introduction to Coding Theory

  1993cited by this paper
• Corrected proof of de Buda's theorem (lattice channel codes)

  1993cited by this paper
• Some optimal codes have structure

  1989cited by this paper
• The Gaussian wire-tap channel

  1978cited by this paper
• Ramanujan Graphs

  1965cited by this paper

• No citing papers are available for this paper.