Enumerating and decoding perfect linear Lee codes

Designs, Codes, and Cryptography

Volumn 52, Issue 2, 2009, Pages 155-162

  Albdaiwi, Bader ^a   Horak, Peter ^b   Milazzo, Lorenzo ^c  

^a KUWAIT UNIVERSITY   (Kuwait)

^b UNIVERSITY OF WASHINGTON   (United States)

^c UNIVERSITY OF CATANIA   (Italy)

Author keywords

Decoding; Enumeration; Perfect Lee code

Indexed keywords

ALGEBRA;

BLOCK LENGTHS; DECODING ALGORITHMS; ENUMERATION; GROUP THEORIES; LINEAR TIME; PERFECT LEE CODE;

DECODING;

EID: 63349108688     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10623-009-9273-3     Document Type: Article

References (9)

1. B.F. AlBdaiwi P. Horak 2002 Perfect distance -d placements in 3-dimensional tori JCMCC 43 159 174
2. B.F. AlBdaiwi B. Bose 2003 Quasi-perfect Lee distance codes IEEE Trans. Inform. Theory 49 1535 1539
3. J. Astola 1978 On perfect codes in the Lee metric Ann. Univ. Turku (A) 1 176 56
4. Golomb S.W., Welsh L.R. Algebraic coding and the Lee metric. In: Error Correcting Codes, pp. 175-189. Wiley, New York (1968).
5. S. Gravier M. Mollard 1998 On the existence of three-dimensional tiling in the Lee metric Eur. J. Comb. 19 567 572
6. P. Horak 2009 Tilings in Lee metric Eur. J. Comb. 30 480 489
7. P. Horak B.F. AlBdaiwi 2006 Fast decoding quasi-perfect Lee distance codes Des. Codes Cryptogr. 40 357 367
8. E. Molnar 1971 Sui mosaici dello spazio di dimensionen, Atti Della Accademia Nazionale dei Lincei Rend. Sci. Fis. Mat. e Nat. 51 177 185
9. S. Szabó 1981 On mosaics consisting of multidimensional crosses Acta Math. Acad. Sci. Hung. 38 191 203