New results on Construction A lattices based on very sparse parity-check matrices Conference Paper uri icon

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 F p . 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. 2013 IEEE.

name of conference

  • 2013 IEEE International Symposium on Information Theory (ISIT)

published proceedings

  • 2013 IEEE International Symposium on Information Theory

author list (cited authors)

  • di Pietro, N., Zemor, G., & Boutros, J. J.

citation count

  • 17

complete list of authors

  • di Pietro, Nicola||Zemor, Gilles||Boutros, Joseph J

publication date

  • July 2013

publisher