Matrix-product codes over finite chain rings

Tim Blackmore and Graham H. Norton introduced the notion of matrix-product codes over finite fields. The present paper provides a generalization to finite chain rings. For codes a distance function is defined using a homogeneous weight function in the ring. It is proved that the minimum distance of a matrix-product codes is determined by the minimum distances of the separate codes. At the end of the paper we focus on Galois rings and define a special family of matrix-product codes.

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

[2]  N. J. A. Sloane,et al.  The Z4-linearity of Kerdock, Preparata, Goethals, and related codes , 1994, IEEE Trans. Inf. Theory.

[3]  Henk C. A. van Tilborg,et al.  Two “Dual” Families of Nearly-Linear Codes over ℤ p , p odd , 2001, Applicable Algebra in Engineering, Communication and Computing.

[4]  Graham H. Norton,et al.  Matrix-Product Codes over ?q , 2001, Applicable Algebra in Engineering, Communication and Computing.

[5]  Marcus Greferath,et al.  Finite-Ring Combinatorics and MacWilliams' Equivalence Theorem , 2000, J. Comb. Theory A.

[6]  Graham H. Norton,et al.  On the Structure of Linear and Cyclic Codes over a Finite Chain Ring , 2000, Applicable Algebra in Engineering, Communication and Computing.