Characters and the equivalence of codes
From MaRDI portal
Publication:1906145
DOI10.1016/S0097-3165(96)80011-2zbMath0849.94019OpenAlexW4213125419MaRDI QIDQ1906145
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
Related Items (21)
MacWilliams extending conditions and quasi-Frobenius rings ⋮ The Extension Theorem with Respect to Symmetrized Weight Compositions ⋮ Group algebras and coding theory ⋮ Frobenius-Artin algebras and infinite linear codes ⋮ The extension theorem for Lee and Euclidean weight codes over integer residue rings ⋮ Characteristics of invariant weights related to code equivalence over rings ⋮ On additive MDS codes over small fields ⋮ On the equivalence of linear codes ⋮ New code equivalence based on relative generalized Hamming weights ⋮ Automorphism groups of Grassmann codes ⋮ Weight-preserving isomorphisms between spaces of continuous functions: the scalar case ⋮ The structure of linear codes of constant weight ⋮ The divisible code bound revisited ⋮ Code equivalence characterizes finite Frobenius rings ⋮ State space realizations and monomial equivalence for convolutional codes ⋮ Divisibility of codes meeting the Griesmer bound ⋮ 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 infinite MacWilliams rings and minimal injectivity conditions ⋮ On extendability of additive code isometries
Cites Work
This page was built for publication: Characters and the equivalence of codes
