Maximum distance separable codes in the \(\rho\) metric over arbitrary alphabets. (English) Zbl 1020.94031
Summary: We give a bound for codes over an arbitrary alphabet in a non-Hamming metric and define MDS codes as codes meeting this bound. We show that MDS codes are precisely those codes that are uniformly distributed and show that their weight enumerators based on this metric are uniquely determined.
Keywords:
finite alphabet; bound; codes over an arbitrary alphabet; non-Hamming metric; MDS codes; uniformly distributedReferences:
| [1] | S.T. Dougherty and K. Shiromoto, “MDR codes over Zk,” IEEE-IT46(1) (2000), 265-269. · Zbl 1001.94039 |
| [2] | S.T. Dougherty and M.M. Skriganov, “MacWilliams duality and the Rosenbloom-Tsfasman metric,” Moscow Mathematical Journal2(1) (2002), 83-99. · Zbl 1024.94012 |
| [3] | F.J. MacWilliams and N.J.A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam, 1977. · Zbl 0369.94008 |
| [4] | W.J. Martin and D.R. Stinson, “Association schemes for ordered orthogonal arrays and (<Emphasis Type=”Italic“>T, M, S)-nets,” Canad.J. Math.51 (1999), 326-346. · Zbl 0938.05018 |
| [5] | M. Yu Rosenbloom and M.A. Tsfasman, “Codes for the m-metric,” Problems of Information Transmission, 33(1) (1997), 45-52. (Translated from Problemy Peredachi Informatsii33(1) (1996), 55-63. · Zbl 1037.94545 |
| [6] | M.M. Skriganov, “Coding theory and uniform distributions,” Algebra i Analiz13(2) (2001), 191-239. (Translation to appear in St. Petersburg Math. J.). · Zbl 0994.11028 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
