ON PERFECT CODES IN THE LEE-ROSENBLOOM-TSFASMAN-JAIN METRIC
Abstract
Keywords
References
- [1] Andrews G. E., (1994) Number Theory, first ed., Dover Publications, Inc., New York,
- [2] Bonnecaze A., Solé P. and Calderbank A. R., (1995) Quaternary quadratic residue codes and unimodular lattices, IEEE Trans. Inform. Theory 2, 41,366–377.
- [3] Heden, O., (2011) The non-existence of some perfect codes over non-prime power alphabets, Discrete Math. 311, 14, 1344–1348.
- [4] Horak P., (2009) On perfect Lee codes, Discrete Math. 309, 18, 5551–5561.
- [5] Jain, S., Nam K. B. and Lee K. S. (2005) On some perfect codes with respect to Lee metric, Linear Algebra Appl. 405, 104–120.
- [6] Lee, C.Y., (1958) Some properties of non-binary error correcting codes, IEEE Trans. Information Theory 4, 2, 77–82.
- [7] van Lint J. H., (1975) A survey of perfect codes, Rocky Mountain J. Math. 5, 199–226.
- [8] Malyugin S. A., (2004) On a lower bound on the number of perfect binary codes, Discrete Appl. Math. 135,1-3, 157–160.
Details
Primary Language
English
Subjects
-
Journal Section
Research Article
Authors
Fatih Demirkale
This is me
0000-0002-6114-1291
Türkiye
Publication Date
December 1, 2019
Submission Date
June 18, 2019
Acceptance Date
October 17, 2019
Published in Issue
Year 2019 Volume: 37 Number: 4