Abstract
We establish a bound on the minimum ρ distance for codes in Mat n,s (Zk) with respect to their ranks and call codes meeting this bound MDR codes. We extend the relationship between codes in Mat n,s (Zk) and distributions in the unit cube and use the Chinese Remainder Theorem to construct codes and distributions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S.T. Dougherty and K. Shiromoto,MDR codes over ℤk IEEE-IT, Vol.46,No.1 (2000)pp.265–269.
S.T. Dougherty and M.M. Skriganov,MacWilliams duality and the Rosenbloom-Tsfasman metric, Moscow Math.Journal, Vol.2,No.1 (2002)pp.81–97.
S.T. Dougherty and M.M. Skriganov,Maximum distance separable codes in a non-Hamming metric over arbitrary alphabets,J.Alg.Combin.Vol.16,No.1 (2002)pp.71–81.
F.J. MacWilliams and N.J.A. Sloane,The Theory of Error-Correcting Codes, North-Holland, Amsterdam (1977).
W.J. Martin and D.R. StinsonAssociation schemes for ordered orthogonal arrays and (T, M, S)-nets, Canad.J.Math.,Vol.51,No.2 (1999)pp.326–346.
B.R. McDonald,Finite Rings with Identity, Marcel Dekker, New York (1974).
M.Yu Rosenbloom and M.A. Tsfasman,Codes for the m-metric,Problems of Information Transmission, Vol.33,No.1 (1997)pp.45–52.(Translated from Problemy Peredachi Informatsii, Vol. 33,No.1 (1996)pp.55–63.)
K. Shiromoto and T. Yoshida,A Singleton bound for linear codes over ℤl (preprint).
M.M. Skriganov,Coding theory and uniform distributions,Algebra i Analiz, Vol.13,No.2 (2001) pp.191–239 (Russian).(English translation in St.Petersburg Math.Journal,No.2 (2002)pp.301–337.).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Dougherty, S.T., Shiromoto, K. Maximum Distance Codes in Mat n,s (Zk) with a Non-Hamming Metric and Uniform Distributions. Designs, Codes and Cryptography 33, 45–61 (2004). https://doi.org/10.1023/B:DESI.0000032606.11770.89
Issue Date:
DOI: https://doi.org/10.1023/B:DESI.0000032606.11770.89