Algebraic lattice codes for linear fading channels

12/19/2017
by   Laura Luzzi, et al.
0

In the decades following Shannon's work, the quest to design codes for the additive white Gaussian noise (AWGN) channel led to the development of a rich theory, revealing a number of beautiful connections between information theory and geometry of numbers. One of the most striking examples is the connection between classical lattice sphere packing and the capacity of the AWGN channel. The main result states that any family of lattice codes with linearly growing Hermite invariant achieves a constant gap to capacity. These classical results and many more can be found in the comprehensive book by Conway and Sloane [5].....

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/27/2023

Tight Upper Bounds on the Error Probability of Spinal Codes over Fading Channels

Spinal codes, a family of rateless codes introduced in 2011, have been p...
research
08/29/2022

Lattice Codes for Lattice-Based PKE

The public key encryption (PKE) protocol in lattice-based cryptography (...
research
08/27/2023

Lattice Codes for CRYSTALS-Kyber

This paper describes a constant-time lattice encoder for the NIST-recomm...
research
05/14/2020

Construction C^ from Self-Dual Codes

Construction C^ was recently introduced as a generalization of the multi...
research
03/24/2019

Semantically Secure Lattice Codes for Compound MIMO Channels

We consider code construction for compound multi-input multi-output (MIM...
research
01/13/2018

Lattice Erasure Codes of Low Rank with Noise Margins

We consider the following generalization of an (n,k) MDS code for applic...
research
11/22/2021

Turbo Autoencoder with a Trainable Interleaver

A critical aspect of reliable communication involves the design of codes...

Please sign up or login with your details

Forgot password? Click here to reset