Characters and the equivalence of codes

DOI10.1016/S0097-3165(96)80011-2zbMATH Open0849.94019OpenAlexW4213125419MaRDI QIDQ1906145FDOQ1906145

Authors: Harold N. Ward, Jay A. Wood 

Publication date: 13 May 1996

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0097-3165(96)80011-2

Recommendations

• On the equivalence of linear codes
• The equivalence of linear codes implies semi-linear equivalence
• scientific article; zbMATH DE number 474654
• Characteristics of invariant weights related to code equivalence over rings

zbMATH Keywords

equivalencelinear codegroup charactersconstant weight linear codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• An elementary proof of the MacWilliams theorem on equivalence of codes
• Title not available (Why is that?)
• Binary Codes Which Are Ideals in the Group Algebra of an Abelian Group
• A bound for divisible codes

Cited In (25)

• On infinite MacWilliams rings and minimal injectivity conditions
• MacWilliams extension property for arbitrary weights on linear codes over module alphabets
• Further results on the semilinear equivalence of linear codes
• On the equivalence of linear codes
• Group algebras and coding theory
• Divisibility of codes meeting the Griesmer bound
• New code equivalence based on relative generalized Hamming weights
• State space realizations and monomial equivalence for convolutional codes
• Finite-ring combinatorics and MacWilliams' equivalence theorem
• MacWilliams extending conditions and quasi-Frobenius rings
• The extension theorem with respect to symmetrized weight compositions
• Equivalence of linear codes with the same weight enumerator
• Frobenius-Artin algebras and infinite linear codes
• The equivalence of linear codes implies semi-linear equivalence
• Code equivalence characterizes finite Frobenius rings
• The extension theorem for Lee and Euclidean weight codes over integer residue rings
• On the equivalence of codes over rings and modules
• Concrete character tables and compatible characters.
• The structure of linear codes of constant weight
• The divisible code bound revisited
• On additive MDS codes over small fields
• Automorphism groups of Grassmann codes
• Commensurate Sequences of Characters
• Weight-preserving isomorphisms between spaces of continuous functions: the scalar case
• Characteristics of invariant weights related to code equivalence over rings

This page was built for publication: Characters and the equivalence of codes

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