Fast decoding of quasi-perfect Lee distance codes

DOI10.1007/s10623-006-0025-3zbMath1205.94126arXiv1109.3475OpenAlexW2039902841MaRDI QIDQ851766

Bader F. AlBdaiwi, Peter Horák

Publication date: 22 November 2006

Published in: IEEE Transactions on Information Theory, Designs, Codes and Cryptography (Search for Journal in Brave)

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

zbMATH Keywords

Fast decodingLee codes

Mathematics Subject Classification ID

Decoding (94B35) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75) Tilings in (n) dimensions (aspects of discrete geometry) (52C22)

Related Items (19)

A new approach towards the Golomb-Welch conjecture ⋮ Packing of ℝ² by Crosses ⋮ Perfect codes in two-dimensional algebraic lattices ⋮ On linear diameter perfect Lee codes with distance 6 ⋮ On the nonexistence of lattice tilings of \(\mathbb{Z}^n\) by Lee spheres ⋮ Perfect codes in the \(\ell_p\) metric ⋮ Partitions into perfect codes in the Hamming and Lee metrics ⋮ A generalization of Lee codes ⋮ On the non-existence of lattice tilings by quasi-crosses ⋮ Lattice-like total perfect codes ⋮ \([1,2\)-sets in graphs] ⋮ Perfect codes in Euclidean lattices ⋮ Tiling \(\mathbb R^5\) by crosses ⋮ On the non-existence of linear perfect Lee codes: the Zhang-Ge condition and a new polynomial criterion ⋮ The \(k\)-distance independence number and 2-distance chromatic number of Cartesian products of cycles ⋮ Quasi-perfect codes in the \(\ell _p\) metric ⋮ Enumerating and decoding perfect linear Lee codes ⋮ On perfect Lee codes ⋮ Rainbow perfect domination in lattice graphs

Cites Work

• On the asymptotic behaviour of Lee-codes
• An Elias-type bound for Lee codes over large alphabets and its application to perfect codes (Corresp.)
• Nonexistence theorems on perfect Lee codes over large alphabets
• Lee-metric BCH codes and their application to constrained and partial-response channels
• Lee distance and topological properties of k-ary n-cubes
• Quasi-perfect Lee distance codes

This page was built for publication: Fast decoding of quasi-perfect Lee distance codes