Related papers: Resolvability on Continuous Alphabets
A natural notion of higher order rectifiability is introduced for subsets of Heisenberg groups $\mathbb{H}^n$ in terms of covering a set almost everywhere by a countable union of $(\mathbf{C}_H^{1,\alpha},\mathbb{H})$-regular surfaces, for…
We derive a lower and upper bound on the reliability function of discrete memoryless multiple-access channel (MAC) with noiseless feedback and variable-length codes (VLCs). For the upper-bound, we use proof techniques of Burnashev for the…
Numerous properties of vector addition systems with states amount to checking the (un)boundedness of some selective feature (e.g., number of reversals, run length). Some of these features can be checked in exponential space by using…
Locally decodable channel codes form a special class of error-correcting codes with the property that the decoder is able to reconstruct any bit of the input message from querying only a few bits of a noisy codeword. It is well known that…
We establish sharp estimates for the convergence rate of the Kranosel'ski\v{\i}-Mann fixed point iteration in general normed spaces, and we use them to show that the asymptotic regularity bound recently proved in [11] (Israel Journal of…
Active learning can reduce the number of samples needed to perform a hypothesis test and to estimate the parameters of a model. In this paper, we revisit the work of Chernoff that described an asymptotically optimal algorithm for performing…
Given a hypothesis space, the large volume principle by Vladimir Vapnik prioritizes equivalence classes according to their volume in the hypothesis space. The volume approximation has hitherto been successfully applied to binary learning…
In this paper we prove a characterization of continuity for polynomials on a normed space. Namely, we prove that a polynomial is continuous if and only if it maps compact sets into compact sets. We also provide a partial answer to the…
The more than thirty years old issue of the (classical) information capacity of quantum communication channels was dramatically clarified during the last years, when a number of direct quantum coding theorems was discovered. The present…
In this paper, we prove well-posedness of the Fornberg-Whitham equation in Besov spaces $B_{2,r}^s$ in both the periodic and non-periodic cases. This will imply the existence and uniqueness of solutions in the aforementioned spaces along…
In this paper, we give a short and self-contained proof to a 1991 conjecture by Moore concerning the structure of certain finite-dimensional Gromov--Hausdorff limits, in the ANR setting. As a consequence, one easily characterizes finite…
This paper deals with the problem of universal lossless coding on a countable infinite alphabet. It focuses on some classes of sources defined by an envelope condition on the marginal distribution, namely exponentially decreasing envelope…
We consider the most general class of linear inhomogeneous boundary-value problems for systems of ordinary differential equations of an arbitrary order whose solutions and right-hand sides belong to appropriate Sobolev spaces. For…
A Dirichlet-type problem is studied for an equation of even order with variable coefficients. A criterion for the uniqueness of a solution is given. The solution is built in the form of a Fourier series. When justifying the convergence of…
This work resolves the open problem of strong singularity ($\alpha(z)> 1$) in nonlocal Kirchhoff-type equations with variable exponents through five original theorems that collectively establish a comprehensive theory. Beginning with…
We propose two types of universal codes that are suited to two asymptotic regimes when the output alphabet is possibly continuous. The first class has the property that the error probability decays exponentially fast and we identify an…
The Survivable Network Design problem (SNDP) is a well-studied problem, motivated by the design of networks that are robust to faults under the assumption that any subset of edges up to a specific number can fail. We consider non-uniform…
In this work we obtain sufficient conditions for the existence of bounded solutions of a resonant multi-point second-order boundary value problem, with a fully differential equation. The noninvertibility of the linear part is overcome by a…
Wyner's soft-covering lemma is the central analysis step for achievability proofs of information theoretic security, resolvability, and channel synthesis. It can also be used for simple achievability proofs in lossy source coding. This work…
Random linear network coding is a particularly decentralized approach to the multicast problem. Use of random network codes introduces a non-zero probability however that some sinks will not be able to successfully decode the required…