Orthogonality matrices for modules over finite Frobenius rings and MacWilliams' equivalence theorem

DOI10.1006/FFTA.2001.0343zbMath1010.94012OpenAlexW2006013398MaRDI QIDQ700162

Marcus Greferath

Publication date: 30 September 2002

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/ffta.2001.0343

zbMATH Keywords

Frobenius ringsMacWilliams equivalence theoremhomogeneous weightslinear codes over ringsMöbius inversion on posets

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)

Related Items (4)

The extension theorem for Lee and Euclidean weight codes over integer residue rings ⋮ MacWilliams' extension theorem for bi-invariant weights over finite principal ideal rings ⋮ Relative one-weight linear codes ⋮ MacWilliams extension property for arbitrary weights on linear codes over module alphabets

Cites Work

• Unnamed Item
• A metric for codes over residue class rings
• Weighted modules and representations of codes
• Finite-ring combinatorics and MacWilliams' equivalence theorem
• Combinatorial theory.
• Kerdock code in a cyclic form
• An elementary proof of the MacWilliams theorem on equivalence of codes
• Duality for modules over finite rings and applications to coding theory
• The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
• Gray isometries for finite chain rings and a nonlinear ternary (36, 3/sup 12/, 15) code
• [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]

This page was built for publication: Orthogonality matrices for modules over finite Frobenius rings and MacWilliams' equivalence theorem