Enumerating and decoding perfect linear Lee codes

DOI10.1007/S10623-009-9273-3zbMath1174.94030OpenAlexW1990315714MaRDI QIDQ735017

Lorenzo Milazzo, Peter Horák, Bader F. AlBdaiwi

Publication date: 14 October 2009

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-009-9273-3

Mathematics Subject Classification ID

Decoding (94B35)

Related Items (5)

Constructions and invariants of optimal codes in the Lee metric ⋮ Partitions into perfect codes in the Hamming and Lee metrics ⋮ Non-periodic tilings of \({\mathbb{R}}^{n}\) by crosses ⋮ Tiling \(\mathbb R^5\) by crosses ⋮ Perfect codes in the discrete simplex

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast decoding of quasi-perfect Lee distance codes
• Tilings in Lee metric
• On the non-existence of 3-dimensional tiling in the Lee metric
• On mosaics consisting of multidimensional crosses
• Quasi-perfect Lee distance codes

This page was built for publication: Enumerating and decoding perfect linear Lee codes