Dense error-correcting codes in the Lee metric

2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings

Volumn , Issue , 2010, Pages

  Etzion, Tuvi ^a   Vardy, Alexander ^b   Yaakobi, Eitan ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALPHABET SIZE; CODING PROBLEMS; ERROR CORRECTING CODE; HADAMARD MATRICES; HIGH RATE; LEE METRIC; LEE SPHERE; MINIMUM DISTANCE; NEW APPLICATIONS; PERFECT CODES; SPHERE PACKING BOUND; THREE PROBLEMS;

MATHEMATICAL TECHNIQUES; PROBLEM SOLVING; SPHERES;

INFORMATION THEORY;

EID: 80051951315     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CIG.2010.5592743     Document Type: Conference Paper

References (32)

1. C. Y. Lee, "Some properties of nonbinary error-correcting code", IRE Trans. Inform. Theory, vol. 4, pp. 72-82, 1958.
2. W. Ulrich, "Non-binary error correction codes", Bell Sys. Journal, vol. 36, pp. 1341-1387, 1957.
3. S. W. Golomb and L. R. Welch, "Perfect codes in the Lee metric and the packing of polyominos", SIAM Journal Applied Math., vol. 18, pp. 302-317, 1970.
4. R. M. Roth and P. H. Siegel, "Lee-metric BCH codes and their application to constrained and partial-response channels", IEEE Trans. Inform. Theory, vol. IT-40, pp. 1083-1096, July 1994.
5. R. M. Roth, Introduction to Coding Theory, Cambridge University Press, 2005.
6. K. A. Post, "Nonexistence theorem on perfect Lee codes over large alphabets", Information and Control, vol. 29, pp. 369-380, 1975.
7. J. Astola, "On perfect Lee codes over small alphabets of odd cardinality", Discrete Applied Mathematics, vol. 4, pp. 227-228, 1982.
8. P. Horak, "On perfect Lee codes", Discrete Mathematics, vol. 309, pp. 5551-5561, 2009.
9. B. AlBdaiwi, P. Horak, L. Milazzo, "Enumerating and decoding perfect linear Lee codes", Des. Codes, Crypt., vol. 52, pp. 155-162, 2009.
10. J. C.-Y. Chiang and J. K. Wolf, "On Channels and codes for the Lee metric", Information and Control, vol. 19, pp. 1593-173, Sept. 1971.
11. C. Satyanarayana, "Lee metric codes over integer residue rings", IEEE Trans. Inform. Theory, vol. IT-25, pp. 250-254, March 1979. (Pubitemid 9443316)
12. K. Nakamura, "A class of error-correcting codes for DPSK channels", in Proc. IEEE Conf. Commun., pp. 45.4.1-45.4.5, 1979.
13. J. T. Astola, "Concatenated codes for the Lee metric", IEEE Trans. Inform. Theory, vol. IT-28, pp. 778-779, September 1982.
14. A. Orlitsky, "Interactive communication of balanced distributions and of correlated files", SIAM J. Discrete Math., vol.6 pp. 548-564, 1993.
15. M.Blaum, J. Bruck, and A.Vardy, "Interleaving schemes for multidimensional cluster errors", IEEE Trans. Inform. Theory, vol. IT-44, pp. 730-743, March 1998. (Pubitemid 128737634)
16. K.-U. Schmidt, "Complementary sets, generalized Reed-Muller codes, and power control for OFDM", IEEE Trans. Inform. Theory, vol. IT-53, pp. 808-814, February 2007. (Pubitemid 46358454)
17. T. Etzion and E. Yaakobi, "Error-Correction of Multidimensional Bursts", IEEE Trans. Inform. Theory, vol. IT-55, pp. 961-976, 2009.
18. A. Barg and A. Mazumdar, "Codes in permutations and error correction for rank modulation", arxiv.org/abs/0908.4094, October 2009.
19. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Amsterdam: North-Holland, 1977.
20. H. Kharaghani and B. Tayfeh-Rezaie, "A Hadamard matrix of order 428", Journal of Combinatorial Designs, vol. 13, pp. 435-440, 2004. (Pubitemid 41655181)
21. H. Minkowski, "Dichteste gitterformige Lagerung kongruenter Korper", Nachrichten Ges. Wiss. Gottingen, pp. 311-355, 1904.
22. R. Cools, "More about cubature formulas and densest packings", East Journal on Approximations, vol. 13, pp. 37-42, 2000.
23. R. Cools and J. N. Lyness, "Three-and four-dimensional K-optimal lattice rules of moderate trigonometric degree", Math. Comp., vol. 70, pp. 1549-1567, 2001. (Pubitemid 33582383)
24. R. Cools and H. Govaert, "Five-and six-dimensional lattice rules generated by structured matrices", J. Complexity, 19, pp. 715-729, 2003. (Pubitemid 38012034)
25. R. Ahlswede, H. K. Aydinian, and L.H. Khachatrian, "On perfect codes and related concepts", Designs, Codes Crypto., vol. 22, pp. 221-237, 2001. (Pubitemid 33690780)
26. Ph. Delsarte, "An algebraic approach to association schemes of coding theory", Philips J. Res., vol. 10, pp. 1-97, 1973.
27. m for Lee and related concepts", Lecture Notes in Computer Science, vol. 5528, pp. 1-10, 2008.
28. R. Ahlswede and L.H. Khachatrian, "The diametric theorem in Hamming spaces-optimal anticodes", Advances in Applied Mathematics, vol. 20, pp. 429-449, 1998. (Pubitemid 128348569)
29. T. Etzion and A. Vardy, "Perfect Binary Codes: Constructions, Properties, and Enumeration", IEEE Trans. Inform. Theory, vol. IT-40, pp. 754-763, 1994.
30. 4-linear Hadamard and extended perfect codes", Electro. Notes Discrete Math., vol.6, pp. 107-112, 2001.
31. K. A. S. Abdel-Ghaffar, "An information-and coding-theoretic study of bursty channels with applications to computer memories", Ph. D. dissertation, California Inst. Technol. Pasadena, CA, June 1986.
32. M. Breitbach, M. Bossert, V. Zyablov, and V. Sidorenko, "Array codes correcting a two-dimensional cluster of errors", IEEE Trans. Inform. Theory, vol. IT-44, pp. 2025-2031, September 1998. (Pubitemid 128738578)