Construction πA and πD Lattices: Construction, Goodness, and Decoding Algorithms

DOI10.1109/TIT.2017.2721421zbMATH Open1374.94830arXiv1506.08269OpenAlexW2963129746MaRDI QIDQ4589403FDOQ4589403

Krishna R. Narayanan, Yu-Chih Huang

Publication date: 10 November 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: A novel construction of lattices is proposed. This construction can be thought of as a special class of Construction A from codes over finite rings that can be represented as the Cartesian product of $L$ linear codes over $mathbb{F}_{p_1},ldots,mathbb{F}_{p_L}$, respectively, and hence is referred to as Construction $p{i}_A$. The existence of a sequence of such lattices that is good for channel coding (i.e., Poltyrev-limit achieving) under multistage decoding is shown. A new family of multilevel nested lattice codes based on Construction $p{i}_A$ lattices is proposed and its achievable rate for the additive white Gaussian channel is analyzed. A generalization named Construction $p{i}_D$ is also investigated which subsumes Construction A with codes over prime fields, Construction D, and Construction $p{i}_A$ as special cases.

Full work available at URL: https://arxiv.org/abs/1506.08269

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35)

Cited In (2)

• Lattices from codes over \(\mathbb {Z}_q\): generalization of constructions \(D\), \(D'\) and \(\overline{D}\)
• Multilevel lattices for compute-and-forward and lattice network coding

This page was built for publication: Construction πA and πD Lattices: Construction, Goodness, and Decoding Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589403)