Related papers: Exact calculation of quantizer constants for arbit…
New lattice quantizers with lower normalized second moments than previously reported are constructed in 13 and 14 dimensions and conjectured to be optimal. Our construction combines an initial numerical optimization with a subsequent…
In this paper we are concerned with finding the vertices of the Voronoi cell of a Euclidean lattice. Given a basis of a lattice, we prove that computing the number of vertices is a #P-hard problem. On the other hand we describe an algorithm…
The optimal lattice quantizer is the lattice which minimizes the (dimensionless) second moment $G$. In dimensions $1$ to $8$, it has been proven that the optimal lattice quantizer is one of the classical lattices, or there is good evidence…
We give a detailed description of the Voronoi region of the Barnes-Wall lattice $\Lambda_{16}$, including its vertices, relevant vectors, and symmetry group. The exact value of its quantizer constant is calculated, which was previously only…
The main objective of this thesis is a classification project for integral lattices. Using Kneser's neighbour method we have developed the computer program tn to classify complete genera of integral lattices. Main results are detailed…
Lattices with minimal normalized second moments are designed using a new numerical optimization algorithm. Starting from a random lower-triangular generator matrix and applying stochastic gradient descent, all elements are updated towards…
40 years ago, Conway and Sloane proposed using the highly symmetrical Coxeter-Todd lattice $K_{12}$ for quantization, and estimated its second moment. Since then, all published lists identify $K_{12}$ as the best 12-dimensional lattice…
We present an adaptation of Voronoi theory for imaginary quadratic number fields of class number greater than 1. This includes a characterisation of extreme Hermitian forms which is analogous to the classic characterisation of extreme…
We describe algorithms which address two classical problems in lattice geometry: the lattice covering and the simultaneous lattice packing-covering problem. Theoretically our algorithms solve the two problems in any fixed dimension d in the…
In practical applications, lattice quantizers leverage discrete lattice points to approximate arbitrary points in the lattice. An effective lattice quantizer significantly enhances both the accuracy and efficiency of these approximations.…
We study the geometry and complexity of Voronoi cells of lattices with respect to arbitrary norms. On the positive side, we show for strictly convex and smooth norms that the geometry of Voronoi cells of lattices in any dimension is similar…
This paper investigates low-dimensional quantizers from the perspective of complex lattices. We adopt Eisenstein integers and Gaussian integers to define checkerboard lattices $\mathcal{E}_{m}$ and $\mathcal{G}_{m}$. By explicitly linking…
In this note we give a polynomial time algorithm for solving the closest vector problem in the class of zonotopal lattices. The Voronoi cell of a zonotopal lattice is a zonotope, i.e. a projection of a regular cube. Examples of zonotopal…
In this letter, we propose a Voronoi shaping method with reduced encoding complexity. The method works for integer shaping and coding lattices satisfying the chain $\Lambda_s \subseteq \textbf{K}\mathbb{Z}^n \subseteq \Lambda_c$, with…
In this paper we present the first known deterministic algorithm for the construction of multiple rank-1 lattices for the approximation of periodic functions of many variables. The algorithm works by converting a potentially large…
We enumerate the low dimensional cells in the Voronoi cell complexes attached to the modular groups $SL_N(Z)$ and $GL_N(Z)$ for $N=8,9,10,11$, using quotient sublattices techniques for $N=8,9$ and linear programming methods for higher…
In a seminal work, Micciancio & Voulgaris (2013) described a deterministic single-exponential time algorithm for the Closest Vector Problem (CVP) on lattices. It is based on the computation of the Voronoi cell of the given lattice and thus…
A lattice quantizer approximates an arbitrary real-valued source vector with a vector taken from a specific discrete lattice. The quantization error is the difference between the source vector and the lattice vector. In a classic 1996…
The usual quantizer based on an n-dimensional lattice L maps a point x in R^n to a closest lattice point. Suppose L is the intersection of lattices L_1, ..., L_r. Then one may instead combine the information obtained by simultaneously…
In this paper we describe an algorithm that quickly computes a maximal a-valued lattice in an F-vector space equipped with a non-degenerate bilinear form, where a is a fractional ideal in a number field F. We then apply this construction to…