Upper Bound for the Coefficients of the Shortest Vector of Random Lattice

被引：0

作者：

Kaminaga, Masahiro ^{[1
]}

机构：

[1] Tohoku Gakuin Univ, Dept Informat Technol Engn, Sendai Shi 9858537, Japan

来源：

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES | 2023年 / E106A卷 / 12期

基金：

日本学术振兴会;

关键词：

lattice; shortest vector problem; REDUCTION;

D O I：

10.1587/transfun.2023EAL2032

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

This paper shows that upper bounds on the coefficients of the shortest vector of a lattice can be represented using the smallest eigenvalue of the Gram matrix for the lattice, obtains its distribution for high dimensional random Goldstein-Mayer lattice, and applies it to determine the percentage of zeros of coefficient vector.

引用

页码：1585 / 1588

页数：4

共 50 条

[41] The variance upper bound for a mixed random variable
Egozcue, Martin
Fuentes Garcia, Luis
COMMUNICATIONS IN STATISTICS-THEORY AND METHODS, 2018, 47 (22) : 5391 - 9395
[42] Upper Bound on Correcting Partial Random Errors
Gaur, Ankita
Sharma, Bhu Dev
CYBERNETICS AND INFORMATION TECHNOLOGIES, 2013, 13 (03) : 41 - 49
[43] Throughput Upper Bound for Random Wireless Network
Kalantari, E.
Malekee, S. Kouhkan
Rahimi, E.
Nirourang, H.
2012 INTERNATIONAL CONFERENCE ON CONNECTED VEHICLES AND EXPO (ICCVE), 2012, : 99 - 102
[44] An upper bound for minimizing coefficients of dimension Kolchin polynomial
M. V. Kondratieva
Programming and Computer Software, 2010, 36 : 83 - 86
[45] An upper bound for minimizing coefficients of dimension Kolchin polynomial
Kondratieva, M. V.
PROGRAMMING AND COMPUTER SOFTWARE, 2010, 36 (02) : 83 - 86
[46] Existence and Upper Semicontinuity of Attractors for Nonautonomous Stochastic Sine-Gordon Lattice Systems with Random Coupled Coefficients
Wang, Zhaojuan
Zhou, Shengfan
DISCRETE DYNAMICS IN NATURE AND SOCIETY, 2016, 2016
[47] ON ESTIMATION OF REGRESSION COEFFICIENTS OF A RANDOM FIELD OF LATTICE POINTS
WANG, SJ
CHINESE MATHEMATICS, 1966, 8 (06): : 808 - &
[48] Single-exponential upper bound for finding shortest paths in three dimensions
Reif, John H., 1600, ACM, New York, NY, United States (41):
[49] Lyapunov exponents of random walks in small random potential: the upper bound
Mountford, Thomas
Mourrat, Jean-Christophe
ELECTRONIC JOURNAL OF PROBABILITY, 2015, 20 : 1 - 18
[50] A NEW UPPER BOUND ON THE COMPLEXITY OF THE ALL PAIRS SHORTEST-PATH PROBLEM
TAKAOKA, T
INFORMATION PROCESSING LETTERS, 1992, 43 (04) : 195 - 199

← 1 2 3 4 5 →