DocumentCode
27664
Title
Some Results Related to the Conjecture by Belfiore and Solé
Author
Ernvall-Hytonen, Anne-Maria
Author_Institution
Dept. of Math. & Stat., Univ. of Helsinki, Helsinki, Finland
Volume
60
Issue
5
fYear
2014
fDate
May-14
Firstpage
2805
Lastpage
2812
Abstract
In the first part of this paper, we consider the relation between kissing number and the secrecy gain. We show that on an n=24m+8k -dimensional even unimodular lattice, if the shortest vector length is at least 2m , then as the number of vectors of length 2m decreases, the secrecy gain increases. We will also prove a similar result on general unimodular lattices. We will also consider the situations with shorter vectors. Furthermore, assuming the conjecture by Belfiore and Solé, we will calculate the difference between inverses of secrecy gains as the number of vectors varies. We will show by an example that there exist two lattices in the same dimension with the same shortest vector length and the same kissing number, but different secrecy gains. Finally, we consider some cases of a question by Elkies by providing an answer for a special class of lattices assuming the conjecture by Belfiore and Solé. We will also get a conditional improvement on some Gaulter´s results concerning the conjecture.
Keywords
encoding; lattice theory; number theory; vectors; Gaussian wiretap coding; conjecture; general unimodular lattices; kissing number; secrecy gain; shortest vector length; theta functions; Encoding; Lattices; Materials; Polynomials; Vectors; Zinc; Secrecy gain; kissing number; theta functions; unimodular lattices; wiretap coding;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.2014.2311075
Filename
6763022
Link To Document