Codes and lattices in the lp metric
نویسندگان
چکیده
Codes and associated lattices are studied in the lp metric, particularly in the l1 (Lee) and the l∞ (maximum) distances. Discussions and results on decoding processes, classification and analysis of perfect or dense codes in these metrics are presented. Keywords—Codes and lattices, lp metric, Lee metric, perfect codes.
منابع مشابه
q-ary lattices in the lp norm and a generalization of the Lee metric
q-ary lattices are obtained from linear q-ary codes via the so-called Construction A. We study these lattices in the lp norm in R and the associated q-ary codes in the induced p-Lee metric in Zq . This induced metric extends to 1 ≤ p < ∞ the well-known Lee metric when p = 1. A previous result on lattice decoding in the Lee metric is generalized for p > 1 and the existence of perfect codes in su...
متن کاملCompleteness results for metrized rings and lattices
The Boolean ring $B$ of measurable subsets of the unit interval, modulo sets of measure zero, has proper radical ideals (for example, ${0})$ that are closed under the natural metric, but has no prime ideal closed under that metric; hence closed radical ideals are not, in general, intersections of closed prime ideals. Moreover, $B$ is known to be complete in its metric. Togethe...
متن کاملLattice Codes for the Binary Deletion Channel
The construction of deletion codes for the Levenshtein metric is reduced to the construction of codes over the integers for the Manhattan metric by run length coding. The latter codes are constructed by expurgation of translates of lattices. These lattices, in turn, are obtained from Construction A applied to binary codes and Z4−codes. A lower bound on the size of our codes for the Manhattan di...
متن کاملOn uniform canonical bases in Lp lattices and other metric structures
We discuss the notion of uniform canonical bases, both in an abstract manner and specifically for the theory of atomless Lp lattices. We also discuss the connection between the de nability of the set of uniform canonical bases and the existence of the theory of beautiful pairs (i.e., with the nite cover property), and prove in particular that the set of uniform canonical bases is de nable in al...
متن کاملExtending LP-Decoding for Permutation Codes from Euclidean to Kendall tau Metric
Invented in the 1960’s, permutation codes have reemerged in recent years as a topic of great interest because of properties making them attractive for certain modern technological applications. In 2011 a decoding method called LP (linear programming) decoding was introduced for a class of permutation codes with a Euclidean distance induced metric. In this paper we comparatively analyze the Eucl...
متن کامل