Abstract
Lattices have been used in several problems in coding theory and cryptography. In this paper we approach -ary lattices obtained via Constructions D, $\D'$ and . It is shown connections between Constructions D and $\D'$. Bounds for the minimum -distance of lattices , and and, under certain conditions, a generator matrix for are presented. In addition, when the chain of codes used is closed under the zero-one addition, we derive explicit expressions for the minimum -distances of the lattices and attached to the distances of the codes used in these constructions.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.