An elementary proof of the MacWilliams theorem on equivalence of codes
From MaRDI portal
Publication:4160834
DOI10.1016/S0019-9958(78)90389-3zbMath0382.94021MaRDI QIDQ4160834
Kenneth P. Bogart, Don Goldberg, Jean Gordon
Publication date: 1978
Published in: Information and Control (Search for Journal in Brave)
Related Items (24)
On equivalence of cyclic and dihedral zero-divisor codes having nilpotents of nilpotency degree two as generators ⋮ MacWilliams extending conditions and quasi-Frobenius rings ⋮ Note sur la notion d'équivalence entre deux codes linéaires ⋮ Characters and the equivalence of codes ⋮ On the equivalence of linear cyclic and constacyclic codes ⋮ On additive MDS codes over small fields ⋮ MacWilliams' extension theorem for rank-metric codes ⋮ A generalized weight for linear codes and a Witt-MacWilliams theorems ⋮ On the equivalence of linear codes ⋮ New code equivalence based on relative generalized Hamming weights ⋮ Projection-forcing multisets of weight changes ⋮ Automorphism groups of Grassmann codes ⋮ MacWilliams' extension theorem for bi-invariant weights over finite principal ideal rings ⋮ Weight-preserving isomorphisms between spaces of continuous functions: the scalar case ⋮ Relative one-weight linear codes ⋮ The structure of linear codes of constant weight ⋮ On equivalency of zero-divisor codes via classifying their idempotent generator ⋮ Orthogonality matrices for modules over finite Frobenius rings and MacWilliams' equivalence theorem ⋮ Code equivalence characterizes finite Frobenius rings ⋮ On the concept of code-isomorphy ⋮ On the equivalence of codes over rings and modules ⋮ Finite-ring combinatorics and MacWilliams' equivalence theorem ⋮ MacWilliams extension property for arbitrary weights on linear codes over module alphabets ⋮ On extendability of additive code isometries
This page was built for publication: An elementary proof of the MacWilliams theorem on equivalence of codes
