Lattice Erasure Codes of Low Rank with Noise Margins

Lattice codes of low rank are considered for an additive Gaussian noise channel with erasures. The objective is to minimize the error probability with no erasures subject to rate and power constraints while ensuring that the error probability under an allowable erasure pattern is bounded from above....

Full description

Saved in:
Bibliographic Details
Published in2018 IEEE International Symposium on Information Theory (ISIT) pp. 961 - 965
Main Author Vaishampayan, Vinay A.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.06.2018
Subjects
Ellipsoid Packing
Ellipsoids
Erasure Codes
Error probability
Generators
Information theory
Lattices
Modulation
Rotation Matrices
Sphere Packing
Upper bound
Online AccessGet full text
ISSN2157-8117
DOI10.1109/ISIT.2018.8437515

Cover

More Information
Summary:Lattice codes of low rank are considered for an additive Gaussian noise channel with erasures. The objective is to minimize the error probability with no erasures subject to rate and power constraints while ensuring that the error probability under an allowable erasure pattern is bounded from above. Allowable erasure patterns considered here are those of fixed cardinality. Bounds on performance are derived, and several constructions are investigated for lattices in dimension four. It is shown that the problem can be viewed as a simultaneous ellipsoid packing problem, a generalization of the well known sphere packing problem.
ISSN:2157-8117
DOI:10.1109/ISIT.2018.8437515