Codes over Finite Ring $\mathbb{Z}_k$, MacWilliams Identity and Theta Function
By: Zhiyong Zheng, Fengxia Liu, Kun Tian
Potential Business Impact:
Makes codes stronger for better data protection.
In this paper, we study linear codes over $\mathbb{Z}_k$ based on lattices and theta functions. We obtain the complete weight enumerators MacWilliams identity and the symmetrized weight enumerators MacWilliams identity based on the theory of theta function. We extend the main work by Bannai, Dougherty, Harada and Oura to the finite ring $\mathbb{Z}_k$ for any positive integer $k$ and present the complete weight enumerators MacWilliams identity in genus $g$. When $k=p$ is a prime number, we establish the relationship between the theta function of associated lattices over a cyclotomic field and the complete weight enumerators with Hamming weight of codes, which is an analogy of the results by G. Van der Geer and F. Hirzebruch since they showed the identity with the Lee weight enumerators.
Similar Papers
MacWilliams Theory over Zk and nu-functions over Lattices
Information Theory
Finds new math rules for error-correcting codes.
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.