Name
Abstract | ||
|---|---|---|
The Korkine-Zolotareff (KZ) reduction is a widely used lattice reduction strategy in communications and cryptography. The Hermite constant, which is a vital constant of lattice, has many applications, such as bounding the length of the shortest nonzero lattice vector and orthogonality defect of lattices. The KZ constant can be used in quantifying some useful properties of KZ reduced matrices. In this paper, we first develop a linear upper bound on the Hermite constant and then use the bound to develop an upper bound on the KZ constant. These upper bounds are sharper than those obtained recently by the first two authors. Some examples on the applications of the improved upper bounds are also presented. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/ISIT.2019.8849452 | 2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) |
Keywords | Field | DocType |
KZ reduction, Hermite constant, KZ constant | Discrete mathematics,Lattice (order),Hermite constant,Matrix (mathematics),Upper and lower bounds,Pure mathematics,Hermite polynomials,Orthogonality,Mathematics,Lattice reduction,Bounding overwatch | Journal |
Volume | Citations | PageRank |
abs/1904.09395 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jinming Wen | 1 | 13 | 1.67 |
| Xiao-Wen Chang | 2 | 208 | 24.85 |
| Jian Weng | 3 | 1073 | 77.90 |