Code equivalence characterizes finite Frobenius rings

DOI10.1090/S0002-9939-07-09164-2zbMath1215.94080OpenAlexW2024307249MaRDI QIDQ5431679

Jay A. Wood

Publication date: 20 December 2007

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9939-07-09164-2

zbMATH Keywords

equivalence theoremHamming weightfinite Frobenius ringsextension property

Mathematics Subject Classification ID

Finite rings and finite-dimensional associative algebras (16P10) Linear codes (general theory) (94B05) Injective modules, self-injective associative rings (16D50) Quasi-Frobenius rings (16L60)

Related Items (29)

Relative generalized Hamming weights over Frobenius rings ⋮ The Extension Theorem with Respect to Symmetrized Weight Compositions ⋮ Enumeration formulas for self-dual cyclic codes ⋮ Isometry groups of additive codes over finite fields ⋮ Tensor products of ideal codes over Hopf algebras ⋮ Group algebras and coding theory ⋮ Parity check systems of nonlinear codes over finite commutative Frobenius rings ⋮ Frobenius-Artin algebras and infinite linear codes ⋮ Two families of few-weight codes over a finite chain ring ⋮ Characteristics of invariant weights related to code equivalence over rings ⋮ Galois LCD codes over rings ⋮ Self-dual codes over commutative Frobenius rings ⋮ Notes on linear codes over finite commutative chain rings ⋮ A note on checkable codes over Frobenius and quasi-Frobenius rings ⋮ Determining all indecomposable codes over some Hopf algebras ⋮ New code equivalence based on relative generalized Hamming weights ⋮ Matrix product codes over finite commutative Frobenius rings ⋮ MacWilliams' extension theorem for bi-invariant weights over finite principal ideal rings ⋮ MacWilliams extension theorems and the local-global property for codes over Frobenius rings ⋮ Lattice of ideals of the polynomial ring over a commutative chain ring ⋮ Isometry groups of combinatorial codes ⋮ MacWilliams’ extension theorem for infinite rings ⋮ Homogeneous metric and matrix product codes over finite commutative principal ideal rings ⋮ Homogeneous weights of matrix product codes over finite principal ideal rings ⋮ Ring geometries, two-weight codes, and strongly regular graphs ⋮ On matrix-product structure of repeated-root constacyclic codes over finite fields ⋮ Isometry groups of combinatorial codes ⋮ MacWilliams extension property for arbitrary weights on linear codes over module alphabets ⋮ On infinite MacWilliams rings and minimal injectivity conditions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite-ring combinatorics and MacWilliams' equivalence theorem
• On the equivalence of codes over finite rings
• Characters and the equivalence of codes
• On the equivalence of codes over rings and modules
• On Frobeniusean algebras. I
• On Frobeniusean algebras. 2
• An elementary proof of the MacWilliams theorem on equivalence of codes
• Duality for modules over finite rings and applications to coding theory
• FINITE QUASI-FROBENIUS MODULES AND LINEAR CODES
• Characterization of finite Frobenius rings

This page was built for publication: Code equivalence characterizes finite Frobenius rings