Bounds for the l₁-distance of q-ary lattices obtained via constructions D, D' and D

DOI10.1007/S40314-017-0453-XMaRDI QIDQ1993548zbMATH OpenOpenAlexFDO

Authors Eleonesio Strey, Sueli I. R. Costa

Publication date 5 November 2018

Published in Computational and Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

distancelatticescodes over ringsconstructionslattices from q-ary codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Abstract: Lattices have been used in several problems in coding theory and cryptography. In this paper we approach $q$-ary lattices obtained via Constructions D, $D^{\prime }$ and $overlineD$. It is shown connections between Constructions D and $D^{\prime }$. Bounds for the minimum $l_1$-distance of lattices $Lambd{a}_D$, $Lambd{a}_{D^{\prime }}$ and $Lambd{a}_{overlineD}$ and, under certain conditions, a generator matrix for $Lambd{a}_{D^{\prime }}$ are presented. In addition, when the chain of codes used is closed under the zero-one addition, we derive explicit expressions for the minimum $l_1$-distances of the lattices $Lambd{a}_D$ and $Lambd{a}_{overlineD}$ attached to the distances of the codes used in these constructions.

Recommendations

• Lattices from codes over \(\mathbb {Z}_q\): generalization of constructions \(D\), \(D'\) and \(\overline{D}\)
• Constructions of full diversity \(D_n\)-lattices for all \(n\)
• Connections between Construction D and related constructions of lattices
• On \(q\)-ary codes with two distances \(d\) and \(d+1\)
• On distances in lattices from algebraic number fields

Cites work

• An improvement to the Minkowski‐Hiawka bound for packing superballs
• Coding for the Lee and Manhattan Metrics With Weighing Matrices
• Coset codes. I. Introduction and geometrical classification
• Coset codes. II. Binary lattices and related codes
• Lattice and construction of high coding gain lattices from codes
• Lattice coding for signals and networks. A structured coding approach to quantization, modulation, and multiuser information theory. With contributions by Bobak Nazer and Yuval Kochman
• Lattice-based Cryptography
• Low-Density Parity-Check Lattices: Construction and Decoding Analysis
• New Lattice Packings of Spheres
• Non-Binary Error Correction Codes*
• Optimality and uniqueness of the Leech lattice among lattices
• Perfect codes in the \(\ell_p\) metric

Cited in

(4)

• Connections between Construction D and related constructions of lattices
• Lattices from codes over \(\mathbb {Z}_q\): generalization of constructions \(D\), \(D'\) and \(\overline{D}\)
• On lattice constructions \(D\) and \(D^\prime\) from \(q\)-ary linear codes
• Construction-D lattice from Garcia–Stichtenoth tower code

This page was built for publication: Bounds for the \(l_1\)-distance of \(q\)-ary lattices obtained via constructions \(\mathrm D\), \(\mathrm D'\) and \(\overline{\mathrm D}\)

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