New results on low-density integer lattices

Nicola Di Pietro, Joseph Boutros, Gilles Zémor, Loïc Brunei

Research output: Contribution to conferencePaper

6 Citations (Scopus)

Abstract

A new family of integer lattices built from Construction A and non-binary low-density parity-check (LDPC) codes has been proposed by the authors in 2012. Lattices in this family are referred to as LDA lattices. Previous experimental results revealed excellent performance which clearly single out LDA lattices among the strongest candidates for potential applications in digital communications and networks, such as network coding and information theoretic security at the physical layer level. In this paper, we show that replacing random codes by LDPC codes in Construction A does not induce any structural loss. More precisely, our main theorem states that LDA lattices can achieve Poltyrev capacity limit on an additive white Gaussian noise channel. We present here the detailed proof and its consequences on the lattice dimension, the finite field size, and the parameters of the LDPC ensemble. The latter has a row weight that increases logarithmically in the code length. In a more recent work, it is proved that the Poltyrev limit is attained by a different LDA ensemble having a small constant row weight.

Original languageEnglish
Pages39-44
Number of pages6
DOIs
Publication statusPublished - 16 May 2013
Event2013 Information Theory and Applications Workshop, ITA 2013 - San Diego, CA, United States
Duration: 10 Feb 201315 Feb 2013

Other

Other2013 Information Theory and Applications Workshop, ITA 2013
CountryUnited States
CitySan Diego, CA
Period10/2/1315/2/13

Fingerprint

Network coding
Security of data
Communication

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems

Cite this

Di Pietro, N., Boutros, J., Zémor, G., & Brunei, L. (2013). New results on low-density integer lattices. 39-44. Paper presented at 2013 Information Theory and Applications Workshop, ITA 2013, San Diego, CA, United States. https://doi.org/10.1109/ITA.2013.6502926

New results on low-density integer lattices. / Di Pietro, Nicola; Boutros, Joseph; Zémor, Gilles; Brunei, Loïc.

2013. 39-44 Paper presented at 2013 Information Theory and Applications Workshop, ITA 2013, San Diego, CA, United States.

Research output: Contribution to conferencePaper

Di Pietro, N, Boutros, J, Zémor, G & Brunei, L 2013, 'New results on low-density integer lattices' Paper presented at 2013 Information Theory and Applications Workshop, ITA 2013, San Diego, CA, United States, 10/2/13 - 15/2/13, pp. 39-44. https://doi.org/10.1109/ITA.2013.6502926
Di Pietro N, Boutros J, Zémor G, Brunei L. New results on low-density integer lattices. 2013. Paper presented at 2013 Information Theory and Applications Workshop, ITA 2013, San Diego, CA, United States. https://doi.org/10.1109/ITA.2013.6502926
Di Pietro, Nicola ; Boutros, Joseph ; Zémor, Gilles ; Brunei, Loïc. / New results on low-density integer lattices. Paper presented at 2013 Information Theory and Applications Workshop, ITA 2013, San Diego, CA, United States.6 p.
@conference{7b3c2aa0678e4df483e8dce8a522cc0b,
title = "New results on low-density integer lattices",
abstract = "A new family of integer lattices built from Construction A and non-binary low-density parity-check (LDPC) codes has been proposed by the authors in 2012. Lattices in this family are referred to as LDA lattices. Previous experimental results revealed excellent performance which clearly single out LDA lattices among the strongest candidates for potential applications in digital communications and networks, such as network coding and information theoretic security at the physical layer level. In this paper, we show that replacing random codes by LDPC codes in Construction A does not induce any structural loss. More precisely, our main theorem states that LDA lattices can achieve Poltyrev capacity limit on an additive white Gaussian noise channel. We present here the detailed proof and its consequences on the lattice dimension, the finite field size, and the parameters of the LDPC ensemble. The latter has a row weight that increases logarithmically in the code length. In a more recent work, it is proved that the Poltyrev limit is attained by a different LDA ensemble having a small constant row weight.",
author = "{Di Pietro}, Nicola and Joseph Boutros and Gilles Z{\'e}mor and Lo{\"i}c Brunei",
year = "2013",
month = "5",
day = "16",
doi = "10.1109/ITA.2013.6502926",
language = "English",
pages = "39--44",
note = "2013 Information Theory and Applications Workshop, ITA 2013 ; Conference date: 10-02-2013 Through 15-02-2013",

}

TY - CONF

T1 - New results on low-density integer lattices

AU - Di Pietro, Nicola

AU - Boutros, Joseph

AU - Zémor, Gilles

AU - Brunei, Loïc

PY - 2013/5/16

Y1 - 2013/5/16

N2 - A new family of integer lattices built from Construction A and non-binary low-density parity-check (LDPC) codes has been proposed by the authors in 2012. Lattices in this family are referred to as LDA lattices. Previous experimental results revealed excellent performance which clearly single out LDA lattices among the strongest candidates for potential applications in digital communications and networks, such as network coding and information theoretic security at the physical layer level. In this paper, we show that replacing random codes by LDPC codes in Construction A does not induce any structural loss. More precisely, our main theorem states that LDA lattices can achieve Poltyrev capacity limit on an additive white Gaussian noise channel. We present here the detailed proof and its consequences on the lattice dimension, the finite field size, and the parameters of the LDPC ensemble. The latter has a row weight that increases logarithmically in the code length. In a more recent work, it is proved that the Poltyrev limit is attained by a different LDA ensemble having a small constant row weight.

AB - A new family of integer lattices built from Construction A and non-binary low-density parity-check (LDPC) codes has been proposed by the authors in 2012. Lattices in this family are referred to as LDA lattices. Previous experimental results revealed excellent performance which clearly single out LDA lattices among the strongest candidates for potential applications in digital communications and networks, such as network coding and information theoretic security at the physical layer level. In this paper, we show that replacing random codes by LDPC codes in Construction A does not induce any structural loss. More precisely, our main theorem states that LDA lattices can achieve Poltyrev capacity limit on an additive white Gaussian noise channel. We present here the detailed proof and its consequences on the lattice dimension, the finite field size, and the parameters of the LDPC ensemble. The latter has a row weight that increases logarithmically in the code length. In a more recent work, it is proved that the Poltyrev limit is attained by a different LDA ensemble having a small constant row weight.

UR - http://www.scopus.com/inward/record.url?scp=84877672929&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84877672929&partnerID=8YFLogxK

U2 - 10.1109/ITA.2013.6502926

DO - 10.1109/ITA.2013.6502926

M3 - Paper

AN - SCOPUS:84877672929

SP - 39

EP - 44

ER -