On the Algebraic Structure Underlying the Support Enumerators of Linear Codes
By: Nitin Kenjale, Anuradha S. Garge
Potential Business Impact:
Counts code parts to improve data safety.
In this paper, we have introduced the concepts of support distribution and the support enumerator as refinements of the classical weight distribution and weight enumerator respectively, capturing coordinate level activity in linear block codes. More precisely, we have established formula for counting codewords in the linear code C whose i-th coordinate is nonzero. Moreover, we derived a MacWilliam's type identity, relating the normalized support enumerators of a linear code and its dual, explaining how coordinate information transforms under duality. Using this identity we deduce a condition for self duality based on the equality of support distributions. These results provide a more detailed understanding of code structure and complement classical weight based duality theory.
Similar Papers
Weight Enumerators From Equivalence Relations and MacWilliams Identities
Information Theory
Makes computer codes stronger against errors.
Weights on finite fields and failures of the MacWilliams identities
Information Theory
Finds new ways to fix errors in messages.
Complete weight enumerators and weight hierarchies for linear codes from quadratic forms
Information Theory
Creates new codes for better error correction.