Lattices and codes with long shadows

dc.creatorElkies, Noam D.
dc.date1999-06-12
dc.date.accessioned2026-07-07T05:29:29Z
dc.date.available2026-07-07T05:29:29Z
dc.descriptionIn 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".
dc.description8 pages. Note: Mark Gaulter has since established the existence of integers N_k also for k=2,3
dc.identifierhttps://arxiv.org/abs/math/9906086
dc.identifierhttp://arxiv.org/abs/math/9906086
dc.identifierMath. Research Letters 2 (1995), 643-651
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/78656
dc.subjectNumber Theory
dc.subject11H55, 11F11, 11H06, 94B05
dc.titleLattices and codes with long shadows
dc.typetext

Files

Collections