Abstract
Using group theory approach, we determine all numbers q for which there exists a linear 1-error correcting perfect Lee code of block length n over Z q , and then we enumerate those codes. At the same time this approach allows us to design a linear time decoding algorithm.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
AlBdaiwi B.F., Horak P.: Perfect distance −d placements in 3-dimensional tori. JCMCC 43, 159–174 (2002)
AlBdaiwi B.F., Bose B.: Quasi-perfect Lee distance codes. IEEE Trans. Inform. Theory 49, 1535–1539 (2003)
Astola J.: On perfect codes in the Lee metric. Ann. Univ. Turku (A) 1(176), 56 (1978)
Golomb S.W., Welsh L.R. Algebraic coding and the Lee metric. In: Error Correcting Codes, pp. 175–189. Wiley, New York (1968).
Gravier S., Mollard M.: On the existence of three-dimensional tiling in the Lee metric. Eur. J. Comb. 19, 567–572 (1998)
Horak P.: Tilings in Lee metric. Eur. J. Comb. 30, 480–489 (2009)
Horak P., AlBdaiwi B.F.: Fast decoding quasi-perfect Lee distance codes. Des. Codes Cryptogr. 40, 357–367 (2006)
Molnar E.: Sui mosaici dello spazio di dimensionen, Atti Della Accademia Nazionale dei Lincei. Rend. Sci. Fis. Mat. e Nat. 51, 177–185 (1971)
Szabó S.: On mosaics consisting of multidimensional crosses. Acta Math. Acad. Sci. Hung. 38, 191–203 (1981)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by J. Jedwab.
Rights and permissions
About this article
Cite this article
AlBdaiwi, B., Horak, P. & Milazzo, L. Enumerating and decoding perfect linear Lee codes. Des. Codes Cryptogr. 52, 155–162 (2009). https://doi.org/10.1007/s10623-009-9273-3
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-009-9273-3