Lattices and codes with long shadows

From MaRDI portal



Abstract: In an earlier paper (math.NT/9906019) we showed that any integral unimodular lattice L of rank n which is not isometric with Z^n has a characteristic vector of norm at most n-8. [A "characteristic vector" of L is a vector w in L such that 2|(v,w-v) for all v in L; it is known that the characteristic vectors all have norm congruent to n mod 8 and comprise a coset of 2L in L.] Here we use modular forms and the classification of unimodular lattices of rank <24 to find all L whose minimal characteristic vectors have norm n-8. Along the way we also obtain congruences and a lower bound on the kissing number of unimodular lattices with minimal norm 2. We then state and prove analogues of these results for self-dual codes, and relate them directly to the lattice problems via "Construction A".


Let \(L\) be an integral unimodular lattice in \(\mathbb{R}^n\). A characteristic vector of \(L\) is a \(w\in L\) such that \((v, w)\equiv (v, v)\bmod 2\) for all \(v\in L\). Such vectors form a coset of \(2L\) in \(L\) with \((w, w)\equiv n\pmod 8\). The main result of the author is the following: Let \(L\) be as above and suppose that \(L\) has no vector of norm 1. Then a) \(L\) has at least \(2n (23- n)\) vectors of norm 2. b) Equality holds if and only if \(L\) has no characteristic vectors of norm \(<n-8\). c) In that case the number of characteristic vectors of norm exactly \(n-8\) is \(n2^{n- 11}\). The proof of the theorem makes use of theta series.











This page was built for publication: Lattices and codes with long shadows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1910661)