Related papers: On the error performance of the $A_n$ lattices
The problem of communicating over the additive white Gaussian noise (AWGN) channel with lattice codes is addressed in this paper. Theoretically, Voronoi constellations have proved to yield very powerful lattice codes when the fine/coding…
In this paper we prove a priori and a posteriori error estimates for a multiscale numerical method for computing equilibria of multilattices under an external force. The error estimates are derived in a $W^{1,\infty}$ norm in one space…
In this paper, new probability bounds are derived for algebraic lattice codes. This is done by using the Dedekind zeta functions of the algebraic number fields involved in the lattice constructions. In particular, it is shown how to upper…
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 explore the use of correlation with simple functions to get lower bounds for arithmetic quantities. In particular, we apply this idea to the power moments of the error term when counting visible lattice points in large spheres.
This paper considers several approximate operators used in a particle method based on a Voronoi diagram. We introduce and study our approximate operators on gradient and Laplace operators. We derive error estimates for these approximate…
In this paper, we theoretically prove a set of fundamental conditions pertaining discrete velocity sets and corresponding weights. These conditions provide sufficient conditions for a priori formulation of lattice Boltzmann models that…
We obtain asymptotic formulae with optimal error terms for the number of lattice points under and near a dilation of the standard parabola, the former improving upon an old result of Popov. These results can be regarded as achieving the…
The simple cubic lattice defines a set of points at regular distances. The volume of the Voronoi cells around each point may serve as a weight for integration over the entire space. We add interstitial points to this grid according to the…
In a recent paper by the same authors, we provided a theoretical foundation for the component-by-component (CBC) construction of lattice algorithms for multivariate $L_2$ approximation in the worst case setting, for functions in a periodic…
In this papar, we point out some mistakes in a proof of an important combinatorial property of $S(\mathbb{A}_n)$, the set of all minimal vectors of lattice $\mathbb{A}_n$, and correct them in the last section. This property plays an…
We revisit the approximate Voronoi cells approach for solving the closest vector problem with preprocessing (CVPP) on high-dimensional lattices, and settle the open problem of Doulgerakis-Laarhoven-De Weger [PQCrypto, 2019] of determining…
We construct integer error-correcting codes and covering codes for the limited-magnitude error channel with more than one error. The codes are lattices that pack or cover the space with the appropriate error ball. Some of the constructions…
We give the cumulative distribution functions, the expected values, and the moments of weighted lattice polynomials when regarded as real functions of independent random variables. Since weighted lattice polynomial functions include…
High energy experimental data can be viewed as a sampling of the relevant phase space. We point out that one can apply Voronoi tessellations in order to understand the underlying probability distributions in this phase space. Interesting…
Within the framework of quenched lattice QCD and using O(a) improved Wilson fermions and non-perturbative renormalisation, a high statistics computation of low moments of the unpolarised nucleon structure functions is given. Particular…
We show that the Voronoi cells of the lattice of integer flows of a finite connected graph $G$ in the quadratic vector space of real valued flows have the following very precise combinatorics: the face poset of a Voronoi cell is isomorphic…
This paper provides the theoretical foundation for the construction of lattice algorithms for multivariate $L_2$ approximation in the worst case setting, for functions in a periodic space with general weight parameters. Our construction…
Precision computation of hadronic physics with lattice QCD is becoming feasible. The last decade has seen percent-level calculations of many simple properties of mesons, and the last few years have seen calculations of baryon masses,…
We prove functional limit theorems for lattice point counting for affine and congruence lattices using the method of moments. Our main tools are higher moment formulae for Siegel transforms on the corresponding homogeneous spaces, which we…