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.
| Original language | English |
|---|---|
| Pages (from-to) | 39-49 |
| Journal | Applicable Algebra in Engineering, Communication and Computing |
| Volume | 19 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 2008 |