Construction-A full-diversity lattices

Joseph Boutros, Jean Claude Belfiore

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

1 Citation (Scopus)

Abstract

Lattices from Construction A and non-binary codes are considered. These lattices are built from number fields as coset codes of the ring of integers OK modulo an ideal I. Diversity of a Construction-A lattice Λ on block-fading channels is guaranteed by the chain Im ⊂ Λ ⊂ OK m. We study how the code alphabet size should be chosen in order to avoid error floors on the Gaussian channel due to the sublattice Im. Our aim is to get Construction-A lattices that are good for both Gaussian and block-fading channels.

Original languageEnglish
Title of host publication2016 9th International Symposium on Turbo Codes and Iterative Information Processing
Subtitle of host publicationPaths to 5G and Beyond, ISTC 2016
PublisherIEEE Computer Society
Pages305-309
Number of pages5
Volume2016-October
ISBN (Electronic)9781509034017
DOIs
Publication statusPublished - 17 Oct 2016
Event9th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2016 - Brest, France
Duration: 5 Sep 20169 Sep 2016

Other

Other9th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2016
CountryFrance
CityBrest
Period5/9/169/9/16

Fingerprint

Fading channels
Fading Channels
Coset
Number field
Modulo
Ring
Integer

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Information Systems
  • Theoretical Computer Science

Cite this

Boutros, J., & Belfiore, J. C. (2016). Construction-A full-diversity lattices. In 2016 9th International Symposium on Turbo Codes and Iterative Information Processing: Paths to 5G and Beyond, ISTC 2016 (Vol. 2016-October, pp. 305-309). [7593126] IEEE Computer Society. https://doi.org/10.1109/ISTC.2016.7593126

Construction-A full-diversity lattices. / Boutros, Joseph; Belfiore, Jean Claude.

2016 9th International Symposium on Turbo Codes and Iterative Information Processing: Paths to 5G and Beyond, ISTC 2016. Vol. 2016-October IEEE Computer Society, 2016. p. 305-309 7593126.

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

Boutros, J & Belfiore, JC 2016, Construction-A full-diversity lattices. in 2016 9th International Symposium on Turbo Codes and Iterative Information Processing: Paths to 5G and Beyond, ISTC 2016. vol. 2016-October, 7593126, IEEE Computer Society, pp. 305-309, 9th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2016, Brest, France, 5/9/16. https://doi.org/10.1109/ISTC.2016.7593126
Boutros J, Belfiore JC. Construction-A full-diversity lattices. In 2016 9th International Symposium on Turbo Codes and Iterative Information Processing: Paths to 5G and Beyond, ISTC 2016. Vol. 2016-October. IEEE Computer Society. 2016. p. 305-309. 7593126 https://doi.org/10.1109/ISTC.2016.7593126
Boutros, Joseph ; Belfiore, Jean Claude. / Construction-A full-diversity lattices. 2016 9th International Symposium on Turbo Codes and Iterative Information Processing: Paths to 5G and Beyond, ISTC 2016. Vol. 2016-October IEEE Computer Society, 2016. pp. 305-309
@inproceedings{8405c617d1a1445c8ac3d225503c528e,
title = "Construction-A full-diversity lattices",
abstract = "Lattices from Construction A and non-binary codes are considered. These lattices are built from number fields as coset codes of the ring of integers OK modulo an ideal I. Diversity of a Construction-A lattice Λ on block-fading channels is guaranteed by the chain Im ⊂ Λ ⊂ OK m. We study how the code alphabet size should be chosen in order to avoid error floors on the Gaussian channel due to the sublattice Im. Our aim is to get Construction-A lattices that are good for both Gaussian and block-fading channels.",
author = "Joseph Boutros and Belfiore, {Jean Claude}",
year = "2016",
month = "10",
day = "17",
doi = "10.1109/ISTC.2016.7593126",
language = "English",
volume = "2016-October",
pages = "305--309",
booktitle = "2016 9th International Symposium on Turbo Codes and Iterative Information Processing",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - Construction-A full-diversity lattices

AU - Boutros, Joseph

AU - Belfiore, Jean Claude

PY - 2016/10/17

Y1 - 2016/10/17

N2 - Lattices from Construction A and non-binary codes are considered. These lattices are built from number fields as coset codes of the ring of integers OK modulo an ideal I. Diversity of a Construction-A lattice Λ on block-fading channels is guaranteed by the chain Im ⊂ Λ ⊂ OK m. We study how the code alphabet size should be chosen in order to avoid error floors on the Gaussian channel due to the sublattice Im. Our aim is to get Construction-A lattices that are good for both Gaussian and block-fading channels.

AB - Lattices from Construction A and non-binary codes are considered. These lattices are built from number fields as coset codes of the ring of integers OK modulo an ideal I. Diversity of a Construction-A lattice Λ on block-fading channels is guaranteed by the chain Im ⊂ Λ ⊂ OK m. We study how the code alphabet size should be chosen in order to avoid error floors on the Gaussian channel due to the sublattice Im. Our aim is to get Construction-A lattices that are good for both Gaussian and block-fading channels.

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

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

U2 - 10.1109/ISTC.2016.7593126

DO - 10.1109/ISTC.2016.7593126

M3 - Conference contribution

VL - 2016-October

SP - 305

EP - 309

BT - 2016 9th International Symposium on Turbo Codes and Iterative Information Processing

PB - IEEE Computer Society

ER -