Connections between Construction D and related constructions of lattices

DOI10.1007/S10623-014-9939-3zbMATH Open1335.94096arXiv1308.6175OpenAlexW2077388449MaRDI QIDQ398950FDOQ398950

Authors: Wittawat Kositwattanarerk, Frédérique Oggier 

Publication date: 18 August 2014

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Abstract: Most practical constructions of lattice codes with high coding gains are multilevel constructions where each level corresponds to an underlying code component. Construction D, Construction D${\displaystyle }$, and Forney's code formula are classical constructions that produce such lattices explicitly from a family of nested binary linear codes. In this paper, we investigate these three closely related constructions along with the recently developed Construction A${\displaystyle }$ of lattices from codes over the polynomial ring $mathbb{F}_2[u]/u^a$. We show that Construction by Code Formula produces a lattice packing if and only if the nested codes being used are closed under Schur product, thus proving the similarity of Construction D and Construction by Code Formula when applied to Reed-Muller codes. In addition, we relate Construction by Code Formula to Construction A${\displaystyle }$ by finding a correspondence between nested binary codes and codes over $mathbb{F}_2[u]/u^a$. This proves that any lattice constructible using Construction by Code Formula is also constructible using Construction A${\displaystyle }$. Finally, we show that Construction A${\displaystyle }$ produces a lattice if and only if the corresponding code over $mathbb{F}_2[u]/u^a$ is closed under shifted Schur product.

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

Recommendations

• Lattices from codes over \(\mathbb {Z}_q\): generalization of constructions \(D\), \(D'\) and \(\overline{D}\)
• How to obtain lattices from \((f,\sigma,\delta)\)-codes via a generalization of construction A
• Bounds for the \(l_1\)-distance of \(q\)-ary lattices obtained via constructions \(\mathrm D\), \(\mathrm D'\) and \(\overline{\mathrm D}\)
• Lattice and construction of high coding gain lattices from codes
• Studies on the squaring construction

zbMATH Keywords

latticescoset codesBarnes-Wall latticeslattices from codesSchur product of codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Other types of codes (94B60) Relations with coding theory (11H71)

Cites Work

• Coset codes. I. Introduction and geometrical classification
• Coset codes. II. Binary lattices and related codes
• A note on optimal unimodular lattices
• Lattice Codes for the Wiretap Gaussian Channel: Construction and Analysis
• Low-Density Parity-Check Lattices: Construction and Decoding Analysis
• New Lattice Packings of Spheres
• Sphere-bound-achieving coset codes and multilevel coset codes

Cited In (8)

• Lattice and construction of high coding gain lattices from codes
• Bounds for the \(l_1\)-distance of \(q\)-ary lattices obtained via constructions \(\mathrm D\), \(\mathrm D'\) and \(\overline{\mathrm D}\)
• Lattices from codes over \(\mathbb {Z}_q\): generalization of constructions \(D\), \(D'\) and \(\overline{D}\)
• Strongly perfect lattices sandwiched between Barnes-Wall lattices
• Local testing of lattices
• On lattice constructions \(D\) and \(D^\prime\) from \(q\)-ary linear codes
• Lattice encoding of cyclic codes from skew-polynomial rings
• Multilevel lattices for compute-and-forward and lattice network coding

This page was built for publication: Connections between Construction D and related constructions of lattices

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