Bounds for the \(l_1\)-distance of \(q\)-ary lattices obtained via constructions \(\mathrm D\), \(\mathrm D'\) and \(\overline{\mathrm D}\) (Q1993548)

A lattice is a discrete additive subgroup of \(n\) dimensional Euclidean space. The \(l_1\)-distance between two elements \(\mathbf{x}\) and \(\mathbf{y}\) in \(n\) dimensional Euclidean space is defined as \(d^1(\mathbf{x},\mathbf{y}) = \sum | x_i - y_i| .\) The authors investigate three constructions, \(D\), \(D'\) and \(\overline{D}\), of lattices involving nested linear codes in \(\mathbf{Z}_q^n\). They give bounds for the minimum \(l_1\)-distance of lattices formed from these constructions. Given that the chain of codes is closed under zero-one addition, they give explicit expressions for the minimum \(l_1\)-distance of the lattices formed in constructions \(D\) and \(\overline{D}\) involving the distances of the codes used to construct the lattices.