Codes over rings of size $p^2$ and lattices over imaginary quadratic fields
T. Shaska, C. Shor, G. Wijesiri

TL;DR
This paper explores the relationship between codes over rings of size p^2 and lattices over imaginary quadratic fields, analyzing their theta functions and conjecturing uniqueness conditions for their complete weight enumerators.
Contribution
It establishes a connection between codes over rings and lattices, expresses theta functions via weight enumerators, and proposes a conjecture on uniqueness for large parameters.
Findings
Theta functions are expressed in terms of complete weight enumerators.
For different ll, the initial terms of theta functions are identical.
Conjecture on the uniqueness of weight enumerators for large ll, verified for small primes.
Abstract
Let be a square-free integer congruent to 3 mod 4 and the ring of integers of the imaginary quadratic field . Codes over rings determine lattices over . If then the ring is isomorphic to or . Given a code over , theta functions on the corresponding lattices are defined. These theta series can be written in terms of the complete weight enumerator of . We show that for any two the first terms of their corresponding theta functions are the same. Moreover, we conjecture that for there is a unique complete weight enumerator corresponding to a given theta function. We verify the conjecture for primes and .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · semigroups and automata theory · Cellular Automata and Applications
