论文信息 - MDR codes over Zk

MDR codes over Zk

In this correspondence, we study maximum distance with respect to rank (MDR) codes over the ring Z/sub k/. We generalize the construction of Bose-Chaudhuri-Hocquenghem (BCH) and Reed-Solomon codes and apply the generalized Chinese remainder theorem to construct codes.

Steven T. Dougherty | Keisuke Shiromoto | S. Dougherty | Keisuke Shiromoto

[1] J. Dénes,et al. Latin squares and their applications , 1974 .

[2] Priti Shankar. On BCH codes over arbitrary integer tings (Corresp.) , 1979, IEEE Trans. Inf. Theory.

[3] S. Dougherty,et al. Self-dual codes over rings and the Chinese remainder theorem , 1999 .

[4] A. Bruen,et al. On the non-existence of certain M.D.S. codes and projective planes , 1983 .

[5] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .

[6] Werner Heise,et al. Informations- und Codierungstheorie , 1983 .

[7] B. R. McDonald. Finite Rings With Identity , 1974 .

[8] P Shankar. On BCH codes over arbitrary integer rings , 1979 .

[9] A. Blokhuis,et al. On M.D.S. codes, arcs inPG(n, q) withq even, and a solution of three fundamental problems of B. Segre , 1988 .

[10] Sergio R. López-Permouth,et al. Cyclic Codes over the Integers Modulopm , 1997 .

[11] Keisuke Shiromoto,et al. Note on MDS codes over the integers modulo pm , 2000 .

[12] D. D. Joshi,et al. A Note on Upper Bounds for Minimum Distance Codes , 1958, Inf. Control..

[13] Tomoyuki Yoshida,et al. A Singleton bound for linear codes over Z/lZ , 2001 .