Related papers: The Voronoi Spherical CDF for Lattices and Linear …
We propose two low-complexity lattice code constructions that have competitive coding and shaping gains. The first construction, named systematic Voronoi shaping, maps short blocks of integers to the dithered Voronoi integers, which are…
Quantum phases characterized by surfaces of gapless excitations are known to violate the otherwise ubiquitous boundary law of entanglement entropy in the form of a multiplicative log correction: $S\sim L^{d-1} \log L$. Using variational…
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…
Voronoi constellations (VCs) are finite sets of vectors of a coding lattice enclosed by the translated Voronoi region of a shaping lattice, which is a sublattice of the coding lattice. In conventional VCs, the shaping lattice is a scaled-up…
Forecasting cosmological constraints from halo-based statistics often suffers from instability in derivative estimates, especially when the number of simulations is limited. This instability reduces the reliability of Fisher forecasts and…
We perturb the SC, BCC, and FCC crystal structures with a spatial Gaussian noise whose adimensional strength is controlled by the parameter a, and analyze the topological and metrical properties of the resulting Voronoi Tessellations (VT).…
The purpose of this note is to clarify the effect of the finite size of spherical particles upon the characteristics of their spatial distribution through a random Poisson process (RPP). This information is of special interest when using…
We study the Voronoi volume function (VVF) -- the distribution of cell volumes (or inverse local number density) in the Voronoi tessellation of any set of cosmological tracers (galaxies/haloes). We show that the shape of the VVF of biased…
We propose a randomized lattice algorithm for approximating multivariate periodic functions over the $d$-dimensional unit cube from the weighted Korobov space with mixed smoothness $\alpha > 1/2$ and product weights…
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…
In the advent of large scale surveys, individually modelling strong-gravitational lenses and their counterpart time-delays in order to precisely measure $H_0$ will become computationally expensive, and highly complex. A complimentary…
This paper introduces an upper bound on the absolute difference between: (a) the cumulative distribution function (CDF) of the sum of a finite number of independent and identically distributed random variables with finite absolute third…
In this work we present an alternative method to obtain a distribution of particles over an hyper surface, such that they obey a rest-mass density distribution $\rho(x^i)$. We use density profiles that can be written as…
A sum of lognormal random variables (RVs) appears in many problems of science and engineering. For example, it is invloved in computing the distribution of recevied signal and interference powers for radio channels subject to lognormal…
In communication through asymmetric channels the capacity-achieving input distribution is not uniform in general. Homophonic coding is a framework to invertibly convert a (usually uniform) message into a sequence with some target…
Given a set of $n$ sites from $\mathbb{R}^d$, each having some positive weight factor, the Multiplicatively Weighted Voronoi Diagram is a subdivision of space that associates each cell to the site whose weighted Euclidean distance is…
We explore the effect of inhomogeneity on electronic properties of the two-dimensional Hubbard model on a square lattice using dynamical mean-field theory (DMFT). The inhomogeneity is introduced via modulated lattice hopping such that in…
In this work, we introduce a definition of the Discrete Fourier Transform (DFT) on Euclidean lattices in $\R^n$, that generalizes the $n$-th fold DFT of the integer lattice $\Z^n$ to arbitrary lattices. This definition is not applicable for…
The concept of the smoothing parameter plays a crucial role in both lattice-based and code-based cryptography, primarily due to its effectiveness in achieving nearly uniform distributions through the addition of noise. Recent research by…
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…