Related papers: Correction to "The Generalized Stochastic Likeliho…
The note clarifies a gap in the proof of the minimum distance for Projective Reed-Muller Codes. The gap was identified by S.Ghorpade and R.Ludhani in a recent article. Here the original thoughts are explained and the gap closed.
Erasure list decoding was introduced to correct a larger number of erasures with output of a list of possible candidates. In the present paper, we consider both random linear codes and algebraic geometry codes for list decoding erasure…
In this paper, explicit error bounds are derived in the approximation of rank $k$ projections of certain $n$-dimensional random vectors by standard $k$-dimensional Gaussian random vectors. The bounds are given in terms of $k$, $n$, and a…
In this paper author was proved the boundedness of the multidimensional Hardy type operator in weighted Lebesgue spaces with a variable exponent. As an application we prove the boundedness of certain sublinear operators on the weighted…
We present a general approach to deriving bounds on the generalization error of randomized learning algorithms. Our approach can be used to obtain bounds on the average generalization error as well as bounds on its tail probabilities, both…
In the context of likelihood ratio testing with parameters on the boundary, we revisit two situations for which there are some discrepancies in the literature: the case of two parameters of interest on the boundary, with all other…
A likelihood encoder is studied in the context of lossy source compression. The analysis of the likelihood encoder is based on the soft-covering lemma. It is demonstrated that the use of a likelihood encoder together with the soft-covering…
We present a new model for LT codes which simplifies the analysis of the error probability of decoding by belief propagation. For any given degree distribution, we provide the first rigorous expression for the limiting error probability as…
The ability to reliably distinguish human-written text from that generated by large language models is of profound societal importance. The dominant approach to this problem exploits the likelihood hypothesis: that machine-generated text…
It is a correction paper on "P.J. Wan and C.W. Yi, "Coverage by Randomly Deployed Wireless Sensor Networks", IEEE Transaction On Information Theory, vol.52, No.6, June 2006." In the above paper, Lemma (4), on page 2659 play the key role for…
This note refers to our previous paper "The emergence of torsion in the continuum limit of distributed edge-dislocations". It identifies and fixes an error in the notion of convergence of Weitzenb\"ock manifolds defined in the paper, and in…
This paper studies the subexponential prefactor to the random-coding bound for a given rate. Using a refinement of Gallager's bounding techniques, an alternative proof of a recent result by Altu\u{g} and Wagner is given, and the result is…
We propose a general error analysis related to the low-rank approximation of a given real matrix in both the spectral and Frobenius norms. First, we derive deterministic error bounds that hold with some minimal assumptions. Second, we…
A conjectural expression of the asymptotic gap between the rate-distortion function of an arbitrary generalized Gaussian multiterminal source coding system and that of its centralized counterpart in the high-resolution regime is proposed.…
This is an erratum to our paper.
The Annals of Applied Probability 16 (2006) 984--1033 [URL: http://projecteuclid.org/euclid.aoap/1151592257]
A generalization of the Reiger bound is presented for the list decoding of burst errors. It is then shown that Reed-Solomon codes attain this bound.
This paper has been withdrawn by the author due to an error in the proof of Proposition 4.8.
We make two tiny corrections to our previous paper with the same title, and also obtain, as a bonus, something new.
This is an erratum to an earlier paper, "Generalizations of the Poincar\'e-Birkhoff theorem." An error in the statement of one of the theorems is corrected.