Algebraic lattice constellations: bounds on performance
From MaRDI portal
Publication:3546545
DOI10.1109/TIT.2005.860452zbMath1182.94060OpenAlexW2129627049WikidataQ59715799 ScholiaQ59715799MaRDI QIDQ3546545
Eva Bayer-Fluckiger, Emanuele Viterbo, Frédérique Oggier
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2005.860452
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)
Related Items (6)
Well-rounded twists of ideal lattices from real quadratic fields ⋮ Algebraic lattice codes for linear fading channels ⋮ Wiretap lattice codes from number fields with no small norm elements ⋮ On the construction of perfect codes from \textit{HEX} signal constellations ⋮ Lattices from abelian extensions and error-correcting codes ⋮ ON WELL-ROUNDED IDEAL LATTICES
This page was built for publication: Algebraic lattice constellations: bounds on performance
