Applications of coding theory to the construction of modular lattices
Journal of Combinatorial Theory Series A
Hi-index | 0.00 |
Let @?0 be a square-free integer congruent to 3 mod 4 and O"K the ring of integers of the imaginary quadratic field K=Q(-@?). Codes C over rings O"K/pO"K determine lattices @L"@?(C) over K. If p@?@? then the ring R:=O"K/pO"K is isomorphic to F"p"^"2 or F"pxF"p. Given a code C over R, theta functions on the corresponding lattices are defined. These theta series @q"@L"""@?"("C")(q) can be written in terms of the complete weight enumerators of C. We show that for any two @?p(n+1)(n+2)2 there is a unique symmetric weight enumerator corresponding to a given theta function. We verify the conjecture for primes p