Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
149 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On a conjecture by Belfiore and Solé on some lattices (1104.3739v2)

Published 19 Apr 2011 in cs.IT, math.IT, and math.NT

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.

Citations (25)

Summary

We haven't generated a summary for this paper yet.