New results on Construction A Lattices based on Very Sparse Parity-Check Matrices Conference Paper

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

authors

• Boutros, Joseph

published proceedings

• 2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT)

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

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• IEEE International Symposium on Information Theory - Proceedings  Journal

Digital Object Identifier (DOI)

• 10.1109/isit.2013.6620512

International Standard Book Number (ISBN) 13

• 9781479904464

start page

• 1675

end page

• +

URL

• https://ieeexplore.ieee.org/xpl/conhome/6597029/proceeding