Integer low-density lattices based on construction A

Nicola Di Pietro, Joseph J. Boutros, Gilles Zemor, Loic Brunel

Research output: Chapter in Book/Report/Conference proceedingConference contribution

36 Citations (Scopus)

Abstract

We describe a new family of integer lattices built from construction A and non-binary LDPC codes. An iterative message-passing algorithm suitable for decoding in high dimensions is proposed. This family of lattices, referred to as LDA lattices, follows the recent transition of Euclidean codes from their classical theory to their modern approach as announced by the pioneering work of Loeliger (1997), Erez, Litsyn, and Zamir (2004-2005). Besides their excellent performance near the capacity limit, LDA lattice construction is conceptually simpler than previously proposed lattices based on multiple nested binary codes and LDA decoding is less complex than real-valued message passing.

Original languageEnglish
Title of host publication2012 IEEE Information Theory Workshop, ITW 2012
Pages422-426
Number of pages5
DOIs
Publication statusPublished - 1 Dec 2012
Event2012 IEEE Information Theory Workshop, ITW 2012 - Lausanne, Switzerland
Duration: 3 Sep 20127 Sep 2012

Publication series

Name2012 IEEE Information Theory Workshop, ITW 2012

Other

Other2012 IEEE Information Theory Workshop, ITW 2012
CountrySwitzerland
CityLausanne
Period3/9/127/9/12

    Fingerprint

ASJC Scopus subject areas

  • Information Systems

Cite this

Di Pietro, N., Boutros, J. J., Zemor, G., & Brunel, L. (2012). Integer low-density lattices based on construction A. In 2012 IEEE Information Theory Workshop, ITW 2012 (pp. 422-426). [6404707] (2012 IEEE Information Theory Workshop, ITW 2012). https://doi.org/10.1109/ITW.2012.6404707