Related papers: Correction to "The Generalized Stochastic Likeliho…

In this work, a likelihood encoder is studied in the context of lossy source compression. The analysis of the likelihood encoder is based on a soft-covering lemma. It is demonstrated that the use of a likelihood encoder together with the…

The trapping redundancy of a linear code is the number of rows of a smallest parity-check matrix such that no submatrix forms an $(a,b)$-trapping set. This concept was first introduced in the context of low-density parity-check (LDPC) codes…

This paper shows that the normalized maximum likelihood~(NML) code-length calculated in [1] is an upper bound on the NML code-length strictly calculated for the Gaussian Mixture Model. When we use this upper bound on the NML code-length, we…

The purpose of this Comment is to point out that there are conceptual and mathematical flaws in the analysis in "Light deflection by Damour-Solodukhin wormholes and Gauss-Bonnet theorem, Phys. Rev. D 98, 044033 (2018) by Ali \"{O}vg\"{u}n".

We investigate the relation between the girth and the guaranteed error correction capability of $\gamma$-left regular LDPC codes when decoded using the bit flipping (serial and parallel) algorithms. A lower bound on the number of variable…

In this paper, we consider quantum error correction over depolarizing channels with non-binary low-density parity-check codes defined over Galois field of size $2^p$ . The proposed quantum error correcting codes are based on the binary…

In this work we present error-correcting codes for random network coding based on rank- metric codes, Ferrers diagrams, and puncturing. For most parameters, the constructed codes are larger than all previously known codes.

We extend the correspondence between two-stage coding procedures in data compression and penalized likelihood procedures in statistical estimation. Traditionally, this had required restriction to countable parameter spaces. We show how to…

Elkies and McMullen [Duke Math.J.~123 (2004) 95--139] have shown that the gaps between the fractional parts of \sqrt n for n=1,\ldots,N, have a limit distribution as N tends to infinity. The limit distribution is non-standard and differs…

In our previous work "Characterization of certain homorphic geodesic cycles on Hermitian locally symmetric manifolds of the noncompact type" in "Modern methods in Complex Analysis" Annals of Math. Studies 138 (1995) 85-118, we formulated a…

We review a number a recent advances in the study of two-dimensional statistical models with strong geometrical constraints. These include folding problems of regular and random lattices as well as the famous meander problem of enumerating…

This note explains an error in Proposition 5.1 of "Fibers of tropicalization," Math. Z. 262 (2009), no. 2, 301-311, discovered by W. Buczynska and F. Sottile, and fills the resulting gap in the proof of the paper's main theorem.

This version corrects a number of mistakes that appeared in the previous draft. In particular, the (EU-LREM) condition is sufficient for existence and uniqueness but not necessary, as we had claimed. We are grateful to P. C. B. Phillips and…

Generalization error bounds are critical to understanding the performance of machine learning models. In this work, building upon a new bound of the expected value of an arbitrary function of the population and empirical risk of a learning…

This paper has been removed by the author due to a misstatement in Theorem 1 and a gap in its proof. A corrected and largely extended successor (a joint work with Thomas Bauer and Tomasz Szemberg) can be found under math.AG/0312211,

The relation between the girth and the guaranteed error correction capability of $\gamma$-left regular LDPC codes when decoded using the bit flipping (serial and parallel) algorithms is investigated. A lower bound on the size of variable…

In this work, we improve upon the guarantees for sparse random embeddings, as they were recently provided and analyzed by Freksen at al. (NIPS'18) and Jagadeesan (NIPS'19). Specifically, we show that (a) our bounds are explicit as opposed…

A lower bound on the maximum likelihood (ML) decoding error exponent of linear block code ensembles, on the erasure channel, is developed. The lower bound turns to be positive, over an ensemble specific interval of erasure probabilities,…

In this note we document a gap in an argument in the above paper, and point to new work in the literature giving a complete proof of the main result.

We give new bounds on the reliability function of a typewriter channel with 5 inputs and crossover probability $1/2$. The lower bound is more of theoretical than practical importance; it improves very marginally the expurgated bound,…