Matrix-product codes over finite chain rings (original) (raw)

Abstract

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.

Access this article

Log in via an institution

Subscribe and save

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Blackmore, T., Norton, G.H.: Matrix-Product Codes over \({\mathbb{F}_{q}}\) . AAECC 12, 477–500 (2001)
    Article MATH MathSciNet Google Scholar
  2. Hammons, A.R., Kumar, P.V., Calderbank, A.R., Sloane, N.J.A., Solé, P.: The \({\mathbb{Z}_{4}}\) -linearity of Kerdock, Preparata, Goethals, and related codes. IEEE Trans. Inform. Theory 40, 301–319 (1994)
    Article MATH MathSciNet Google Scholar
  3. van Asch, A.G., van Tilborg, H.C.A.: Two “dual” families of nearly-linear codes over \({\mathbb{Z}_{p}}\) , p odd. AAECC 11, 313–329 (2001)
    Article MATH Google Scholar
  4. Graham, H.N.: Ana Sălăgean, on the structure of linear and cyclic codes over a finite chain ring. AAECC 10, 489–506 (2000)
    Article MATH Google Scholar
  5. MacDonald, B.R.: Finite rings with identity. Dekker, New York (1974)
    Google Scholar
  6. Greferath, M., Schmidt, S.E.: Finite-ring combinatorics and MacWilliams’ Equivalence Theorem. J. Comb. Theory Ser. A 92, 17–28 (2000)
    Article MATH MathSciNet Google Scholar

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands
    Bram van Asch

Corresponding author

Correspondence toBram van Asch.

Rights and permissions

About this article

Cite this article

van Asch, B. Matrix-product codes over finite chain rings.AAECC 19, 39–49 (2008). https://doi.org/10.1007/s00200-008-0063-3

Download citation

Keywords

Mathematics Subject Classification (2000)