Generalized Hamming weights and equivalences of codes

From MaRDI portal





The authors generalize a theorem of MacWilliams that says that any isometry of linear codes over a finite field is a monomial equivalence (i.e., it is induced by the product of a permutation matrix and a diagonal matrix with nonzero diagonal entries). The main theorem proved by the authors shows that any linear isomorphism between two linear \([n,k]\)-codes over a finite field that preserves Hamming \(t\)-weight (for some \(t\) with \(0<t<k\)) is a monomial equivalence.




Cited in
(29)








This page was built for publication: Generalized Hamming weights and equivalences of codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q813793)