Monimial Matrix Analogue of Yoshida's theorem
By: Ananda Chakraborty
Potential Business Impact:
Makes computer codes stronger against errors.
In this paper, we study variants of weight enumerators of linear codes over $\mathbb{F}_q$. We generalize the concept of average complete joint weight enumerators of two linear codes over $\mathbb{F}_q$. We also give its MacWilliams type identities. Then we establish a monomial analogue of Yoshida's theorem for this average complete joint weight enumerators. Finally, we present the generalized representation for average of $g$-fold complete joint weight enumerators for $\mathbb{F}_q$-linear codes and establish a monomial matrix analogue of Yoshida's theorem for average $g$-fold complete joint weight enumerators.
Similar Papers
Complete weight enumerators and weight hierarchies for linear codes from quadratic forms
Information Theory
Creates new codes for better error correction.
Weight Enumerators From Equivalence Relations and MacWilliams Identities
Information Theory
Makes computer codes stronger against errors.
Cartesian square-free codes
Information Theory
Makes secret codes stronger and easier to break.