Quasi-perfect Lee distance codes

IEEE Transactions on Information Theory

Volumn 49, Issue 6, 2003, Pages 1535-1539

  AlBdaiwi, Bader F ^a   Bose, Bella ^b  

^a KUWAIT UNIVERSITY   (Kuwait)

^b 202 Apperson Hall   (United States)

Author keywords

Lee codes; Lee distance; Perfect Lee codes; Quasi perfect Lee codes

Indexed keywords

CODES (SYMBOLS); DECODING; ENCODING (SYMBOLS); ERRORS;

LEE DISTANCE CODES;

INFORMATION THEORY;

EID: 0038042067     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2003.811922     Document Type: Article

References (22)

1. J. Astola, "Concatenated codes for the Lee metric," IEEE Trans. Inform. Theory, vol. IT-28, pp. 778-779, Sept. 1982.
2. _, "On constructing codes and the Lee-metric," Ars Combin., vol. 20-A, pp. 141-152, 1985.
3. E. Berlekamp, Algebraic Coding Theory. New York: McGraw-Hill Inc., 1968.
4. J. Chiang and J. Wolf, "On channels and codes for the Lee-metric," Inform. Contr., vol. 19, pp. 159-173, 1971.
5. R. Roth and P. Siegel, "Lee-metric BCH codes and their application to constrained and partial-response channels," IEEE Trans. Inform. Theory, vol. 40, pp. 1083-1095, July 1994.
6. B. Bose, R. Broeg, Y. Kwon, and Y. Ashir, "Lee distance and topological properties of k-ary n-cubes," IEEE Trans. Comput., vol. 44, pp. 1021-1030, Aug. 1995.
7. M. Bae and B. Bose, "Resource placement in torus-based networks," IEEE Trans. Comput., vol. 46, no. 10, pp. 1083-1092, Oct. 1997.
8. B. F. AlBdaiwi AlMohammad, "On resource placements and fault-tolerant broadcasting in toroidal networks," Ph.D. dissertation, Dept. Comput. Sci., Oregon State Univ., Corvallis, Nov. 1997.
9. B. AlBdaiwi AlMohammad, J. H. Kim, and B. Bose, "I/O placement strategies and their data locality sensitivities in k × k toroidal networks," in Proc. HPC Asia'97 Conf. and Exhibition, Seoul, Korea, 1997, pp. 343-348.
10. _, "I/O placements and network latencies in k × k toroidal networks," Math. Modeling Scient. Computing, Sept. 1997.
11. B. AlBdaiwi AlMohammad and B. Bose, "I/O placements in 2D toroidal networks," in Proc. IEEE Int. Parallel Processing Symp., Apr. 1998, pp. 431-438.
12. S. Golomb and L. Welch, "Algebric coding and the Lee metric," in Error Correcting Codes: Proceedings of a Symposium Conducted by Mathematics Research Center, H. Mann, Ed. New York: Wiley, May 1968, pp. 175-194.
13. J. Astola, "On the nonexistence of certain perfect Lee-error-correcting codes," Ann. Univ. Turku, ser. A-I, no. 167, 1975.
14. _, "On perfect codes in the Lee metric," Ann. Univ. Turku, ser. A-I, no. 176, 1978.
15. _, "An elias-type bound for Lee codes and its applications to perfect codes," IEEE Trans. Inform. Theory, vol. IT-28, pp. 111-113, Jan. 1982.
16. _, "The Lee scheme and bounds for Lee-codes," Cybern. and Syst.: Int. J., vol. 13, pp. 331-343, 1982.
17. _, "On the asymptotic behavior of Lee-codes," Discr. Appl. Math., vol. 8, pp. 13-23, 1984.
18. K. Post, "Nonexistence theorems on perfect Lee codes over large alphabets," Inform. Contr., vol. 29, pp. 369-380, 1975.
19. A. Racsmány, "Perfect single-Lee-error-correcting code," Studia Scient. Math., vol. 9, pp. 73-75, 1974.
20. _, "Correction to my paper 'Perfect single-Lee-error-correcting code'," Studio Scient. Math., vol. 23, pp. 295-296, 1988.
21. T. Lepistö, "Bounds for perfect Lee-codes over small alphabets," Ann. Univ. Turkuensis, ser. A-I, no. 186, pp. 59-63, 1984.
22. M. Livingston and Q. Stout, "Perfect dominating sets," Congressus Numerantium, vol. 79, pp. 187-203, 1990.