In this paper, we prove the following theorem due to MacWilliams. Two codes are equivalent if and only if there is a weight preserving linear isomorphism between them. The proof we give is a simplification and extension of her proof to the most general case
AbstractIn light of the result by Wood that codes over every finite Frobenius ring satisfy a version...
AbstractIn this note, we consider the notion of simple components of a linear code over the field F ...
AbstractA MacWilliams identity for complete weight enumerators of codes over Mn×s(Fq) endowed with a...
For codes over fields, the MacWilliams equivalence theorem gives us a complete characterization when...
In the 1960's Florence MacWilliams proved two important results in coding theory. The first result i...
The famous MacWilliams Extension Theorem states that for classical codes each linear Hamming isometr...
In this thesis we revisit some classical results about the MacWilliams equivalence theorems for code...
AbstractMacWilliams' equivalence theorem states that Hamming isometries between linear codes extend ...
In this thesis we revisit some classical results about the MacWilliams equivalence theorems for code...
Le fameux Théorème d’Extension de MacWilliams affirme que, pour les codes classiques, toute isométri...
AbstractA generalization of the MacWilliams relation between the Hamming weight distributions in a l...
AbstractMacWilliams' equivalence theorem states that Hamming isometries between linear codes extend ...
In the 1960's Florence MacWilliams proved two important results in coding theory. The first result i...
AbstractF. J. MacWilliams proved that Hamming isometries between linear codes extend to monomial tra...
AbstractIn this note, we consider the notion of simple components of a linear code over the field F ...
AbstractIn light of the result by Wood that codes over every finite Frobenius ring satisfy a version...
AbstractIn this note, we consider the notion of simple components of a linear code over the field F ...
AbstractA MacWilliams identity for complete weight enumerators of codes over Mn×s(Fq) endowed with a...
For codes over fields, the MacWilliams equivalence theorem gives us a complete characterization when...
In the 1960's Florence MacWilliams proved two important results in coding theory. The first result i...
The famous MacWilliams Extension Theorem states that for classical codes each linear Hamming isometr...
In this thesis we revisit some classical results about the MacWilliams equivalence theorems for code...
AbstractMacWilliams' equivalence theorem states that Hamming isometries between linear codes extend ...
In this thesis we revisit some classical results about the MacWilliams equivalence theorems for code...
Le fameux Théorème d’Extension de MacWilliams affirme que, pour les codes classiques, toute isométri...
AbstractA generalization of the MacWilliams relation between the Hamming weight distributions in a l...
AbstractMacWilliams' equivalence theorem states that Hamming isometries between linear codes extend ...
In the 1960's Florence MacWilliams proved two important results in coding theory. The first result i...
AbstractF. J. MacWilliams proved that Hamming isometries between linear codes extend to monomial tra...
AbstractIn this note, we consider the notion of simple components of a linear code over the field F ...
AbstractIn light of the result by Wood that codes over every finite Frobenius ring satisfy a version...
AbstractIn this note, we consider the notion of simple components of a linear code over the field F ...
AbstractA MacWilliams identity for complete weight enumerators of codes over Mn×s(Fq) endowed with a...
DOI
Add to ORKG