MacWilliams Theory over Zk and nu-functions over Lattices
By: Zhiyong Zheng, Fengxia Liu, Kun Tian
Potential Business Impact:
Finds new math rules for error-correcting codes.
Continuing previous works on MacWilliams theory over codes and lattices, a generalization of the MacWilliams theory over $\mathbb{Z}_k$ for $m$ codes is established, and the complete weight enumerator MacWilliams identity also holds for codes over the finitely generated rings $\mathbb{Z}_k[\xi]$. In the context of lattices, the analogy of the MacWilliams identity associated with nu-function was conjectured by Sol\'{e} in 1995, and we present a new formula for nu-function over the lattices associated with a ternary code, which is rather different from the original conjecture. Furthermore, we provide many counterexamples to show that the Sol\'{e} conjecture never holds in the general case, except for the lattices associated with a binary code.
Similar Papers
Codes over Finite Ring $\mathbb{Z}_k$, MacWilliams Identity and Theta Function
Information Theory
Makes codes stronger for better data protection.
A multiset approach to MacWilliams identities
Combinatorics
Finds new math rules for better computer codes.
Weight Enumerators From Equivalence Relations and MacWilliams Identities
Information Theory
Makes computer codes stronger against errors.