2000 character limit reached
On a conjecture by Belfiore and Solé on some lattices
Published 19 Apr 2011 in cs.IT, math.IT, and math.NT | (1104.3739v2)
Abstract: The point of this note is to prove that the secrecy function attains its maximum at y=1 on all known extremal even unimodular lattices. This is a special case of a conjecture by Belfiore and Sol\'e. Further, we will give a very simple method to verify or disprove the conjecture on any given unimodular lattice.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.