Extension Theorems for Linear Codes over Finite Rings

Various forms of the extension problem are discussed for linear codes de ned over nite rings. The extension theorem for symmetrized weight compositions over nite Frobenius rings is proved. As a consequence, an extension theorem for weight functions over certain nite commutative rings is also proved. The proofs make use of the linear independence of characters as well as the linear independence of characters averaged over the orbits of a group action.

• Type: Conference
• Year: 1997
• Where: AAECC
• Authors: Jay A. Wood
• Keywords: AAECC 1997, Algorithms, Extension Theorem, Nite Commutative Rings, Nite Frobenius Rings