Finite-Ring Combinatorics and MacWilliams' Equivalence Theorem

✍ Scribed by M. Greferath; S.E. Schmidt

• Publisher: Elsevier Science
• Year: 2000
• Tongue: English
• Weight: 118 KB
• Volume: 92
• Category: Article
• ISSN: 0097-3165
• DOI: 10.1006/jcta.1999.3033

✦ Synopsis

F. J. MacWilliams proved that Hamming isometries between linear codes extend to monomial transformations. This theorem has recently been generalized by J. Wood who proved it for Frobenius rings using character theoretic methods. The present paper provides a combinatorial approach: First we extend I. Constantinescu's concept of homogeneous weights on arbitrary finite rings and prove MacWilliams' equivalence theorem to hold with respect to these weights for all finite Frobenius rings. As a central tool we then establish a general inversion principle for real functions on finite modules that involves Mo bius inversion on partially ordered sets. An application of the latter yields the aforementioned result of Wood.