Bounds for the l1l_1-distance of qq-ary lattices obtained via Constructions D, D′^{'} and D‾\overline{D}

preprint2016arXivOpen access

Abstract

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

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.