Related papers: Exact Exponents for Concentration and Isoperimetry…
This work establishes the exact exponents for the soft-covering phenomenon of a memoryless channel under the total variation metric when random (i.i.d. and constant-composition) channel codes are used. The exponents, established herein, are…
This paper studies expurgated random-coding bounds and exponents for channel coding with a given (possibly suboptimal) decoding rule. Variations of Gallager's analysis are presented, yielding several asymptotic and non-asymptotic bounds on…
Optimal values and solutions of empirical approximations of stochastic optimization problems can be viewed as statistical estimators of their true values. From this perspective, it is important to understand the asymptotic behavior of these…
The problem of variable-rate lossless data compression is considered, for codes with and without prefix constraints. Sharp bounds are derived for the best achievable compression rate of memoryless sources, when the excess-rate probability…
The isoperimetric problem is a classic topic in geometric measure theory, yet critical questions regarding the characterization of optimal solutions -- even asymptotically optimal ones -- remain largely unresolved. In this paper, we…
This paper presents a saddlepoint approximation of the random-coding union bound of Polyanskiy et al. for i.i.d. random coding over discrete memoryless channels. The approximation is single-letter, and can thus be computed efficiently.…
We derive high-order terms in the asymptotic expansions of the steady-state voltage potentials in the presence of a finite number of diametrically small inhomogeneities with conductivities different from the background conductivity. Our…
The purpose of this note is to show how simple Optimal Transport arguments, on the real line, can be used in Superconcentration theory. This methodology is efficient to produce sharp non-asymptotic variance bounds for various functionals…
This paper provides an extensive study of the behavior of the best achievable rate (and other related fundamental limits) in variable-length lossless compression. In the non-asymptotic regime, the fundamental limits of fixed-to-variable…
The aim of this paper is to study asymptotic geometric properties almost surely or/and in probability of extreme order statistics of an i.i.d. random field (potential) indexed by sites of multidimensional lattice cube, the volume of which…
This paper considers the problem of channel coding with a given (possibly suboptimal) maximum-metric decoding rule. A cost-constrained random-coding ensemble with multiple auxiliary costs is introduced, and is shown to achieve error…
This paper is devoted to the computation of the asymptotic boundary terms in entropy methods applied to a fast diffusion equation with weights associated with Caffarelli-Kohn-Nirenberg interpolation inequalities. So far, only elliptic…
Asymptotic expansions are derived for solutions of the parabolic cylinder and Weber differential equations. In addition the inhomogeneous versions of the equations are considered, for the case of polynomial forcing terms. The expansions…
This paper studies the concentration properties of random codes. Specifically, we show that, for discrete memoryless channels, the error exponent of a randomly generated code with pairwise-independent codewords converges in probability to…
For a discrete memoryless channel with finite input and output alphabets, we prove convergence of a parametric family of iterative computations of the optimal correct-decoding exponent. The exponent, as a function of communication rate, is…
We investigate the nonparametric, composite hypothesis testing problem for arbitrary unknown distributions in the asymptotic regime where both the sample size and the number of hypotheses grow exponentially large. Such asymptotic analysis…
In this paper, we discuss asymptotic relations for the approximation of $\left\vert x\right\vert ^{\alpha},\alpha>0$ in $L_{\infty}\left[ -1,1\right] $ by Lagrange interpolation polynomials based on the zeros of the Chebyshev polynomials of…
Asymptotic concentration behaviors of linear combinations of weight distributions on the random linear code ensemble are presented. Many important properties of a binary linear code can be expressed as the form of a linear combination of…
The paper focuses on general properties of parametric minimum contrast estimators. The quality of estimation is measured in terms of the rate function related to the contrast, thus allowing to derive exponential risk bounds invariant with…
We study expected values of the polynomials $P_N^{}(z)=\prod_{1\leq n\leq N}(X_n^2+z^2)$ whose $2N$ zeros $\{\pm i X_k\}^{}_{k=1,...,N}$ are generated by $N$ identically distributed multi-variate mean-zero normal random variables…