MacWilliams Theory over Zk and nu-functions over Lattices
Abstract
Continuing previous works on MacWilliams theory over codes and lattices, a generalization of the MacWilliams theory over Zk for m codes is established, and the complete weight enumerator MacWilliams identity also holds for codes over the finitely generated rings Zk[]. 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.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.