相关论文: Optimal quantization for some triadic uniform Cant…
The representation of a given quantity with less information is often referred to as `quantization' and it is an important subject in information theory. In this paper, we have considered absolutely continuous probability measures on unit…
Let $E$ be a Moran set on $\mathbb{R}^1$ associated with a closed interval $J$ and two sequences $(n_k)_{k=1}^\infty$ and $(\mathcal{C}_k=(c_{k,j})_{j=1}^{n_k})_{k\geq1}$. Let $\mu$ be the infinite product measure (Moran measure) on $E$…
We explore the problem of distributed Hypothesis Testing (DHT) against independence, focusing specifically on Binary Symmetric Sources (BSS). Our investigation aims to characterize the optimal quantizer among binary linear codes, with the…
By a Cantor-like measure we mean the unique self-similar probability measure $\mu $ satisfying $\mu =\sum_{i=0}^{m-1}p_{i}\mu \circ S_{i}^{-1}$ where $% S_{i}(x)=\frac{x}{d}+\frac{i}{d}\cdot \frac{d-1}{m-1}$ for integers $2\leq d<m\le 2d-1$…
Recently, Gilmer proved the first constant lower bound for the union-closed sets conjecture via an information-theoretic argument. The heart of the argument is an entropic inequality involving the OR function of two i.i.d.\ binary vectors,…
We consider the problem of hypothesis testing for discrete distributions. In the standard model, where we have sample access to an underlying distribution $p$, extensive research has established optimal bounds for uniformity testing,…
Let $\mu$ be an Ahlfors-David probability measure on $\mathbb{R}^q$, namely, there exist some constants $s_0>0$ and $\epsilon_0,C_1,C_2>0$ such that \[ C_1\epsilon^{s_0}\leq\mu(B(x,\epsilon))\leq…
We consider a channel with a binary input X being corrupted by a continuous-valued noise that results in a continuous-valued output Y. An optimal binary quantizer is used to quantize the continuous-valued output Y to the final binary output…
Let $\nu$ be a Borel probability measure on a $d$-dimensional Euclidean space $\mathbb{R}^d$, $d\geq 1$, with a compact support, and let $(p_0, p_1, p_2, \ldots, p_N)$ be a probability vector with $p_j>0$ for $0\leq j\leq N$. Let $\{S_j:…
For probability distributions on $\mathbb{R}^n$, we study the optimal sample size N = N(n,p) that suffices to uniformly approximate the pth moments of all one-dimensional marginals. Under the assumption that the marginals have bounded 4p…
We investigate the optimal approximation to triple incompatible quantum measurements within the framework of statistical distance and joint measurability. According to the lower bound of the uncertainty inequality presented in [Physical…
In this paper, we have studied various mixed distributions generated by two uniform distributions: first, where the supports are two connected line segments, and second, where the supports are two disconnected line segments. For these mixed…
The precession protocol involves measuring $P_3$, the probability that a uniformly precessing observable (like the position of a harmonic oscillator or a coordinate undergoing spatial rotation) is positive at one of three equally spaced…
We establish for dual quantization the counterpart of Kieffer's uniqueness result for compactly supported one dimensional probability distributions having a $\log$-concave density (also called strongly unimodal): for such distributions,…
For a given $r \in (0, +\infty)$, the quantization dimension of order $r$, if it exists, denoted by $D_r(\mu)$, represents the rate at which the $n$th quantization error of order $r$ approaches to zero as the number of elements $n$ in an…
A number of engineering and scientific problems require representing and manipulating probability distributions over large alphabets, which we may think of as long vectors of reals summing to $1$. In some cases it is required to represent…
We investigated the asymptotics of high-rate constrained quantization errors for a compactly supported probability measure P on Euclidean spaces whose quantizers are confined to a closed set S. The key tool is the metric projection of K…
In this paper, we compute the tightest possible bounds on the probability that the optimal value of a combinatorial optimization problem in maximization form with a random objective exceeds a given number, assuming only knowledge of the…
We consider condensation measures of the form $P:=\frac 13 P\circ S_1^{-1}+ \frac 13 P\circ S_2^{-1}+ \frac 13 \nu $ associated with the system $(\mathcal{S}, (\frac 13, \frac 13, \frac 13), \nu) , $ where $\mathcal{S}=\{S_i\}_{i=1}^2 $ are…
We investigate the possibility of defining meaningful upper and lower quantization dimensions for a compactly supported Borel probability measure of order $r$, including negative values of $r$. To this end, we use the concept of partition…