New results on Construction A lattices based on very sparse parity-check matrices

Nicola Di Pietro, Gilles Zemor, Joseph Boutros

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

16 Citations (Scopus)

Abstract

We address the problem of transmission of information over the AWGN channel using lattices. In particular, we will deal with previously introduced LDA lattices which are obtained by Construction A from LDPC codes over the finite field Fp. We will show how to build a particular ensemble of LDA lattices related to bipartite graphs with good expansion properties. We investigate the quality of this family under lattice decoding and show that a random member in it can be reliably decoded for any value of the channel noise variance up to Poltyrev limit. Values of p and the parameters for which optimal performance is guaranteed under lattice decoding are in accordance with the optimal parameters found experimentally under iterative decoding.

Original languageEnglish
Title of host publication2013 IEEE International Symposium on Information Theory, ISIT 2013
Pages1675-1679
Number of pages5
DOIs
Publication statusPublished - 19 Dec 2013
Event2013 IEEE International Symposium on Information Theory, ISIT 2013 - Istanbul, Turkey
Duration: 7 Jul 201312 Jul 2013

Other

Other2013 IEEE International Symposium on Information Theory, ISIT 2013
CountryTurkey
CityIstanbul
Period7/7/1312/7/13

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics

Cite this

Di Pietro, N., Zemor, G., & Boutros, J. (2013). New results on Construction A lattices based on very sparse parity-check matrices. In 2013 IEEE International Symposium on Information Theory, ISIT 2013 (pp. 1675-1679). [6620512] https://doi.org/10.1109/ISIT.2013.6620512