Related papers: Analysis of the Second Moment of the LT Decoder
We study the problem of discrete distribution estimation in KL divergence and provide concentration bounds for the Laplace estimator. We show that the deviation from mean scales as $\sqrt{k}/n$ when $n \ge k$, improving upon the best prior…
Random sequential adsorption of straight rigid rods of length $k$ ($k$-mers) on a simple cubic lattice has been studied by numerical simulations and finite-size scaling analysis. The calculations were performed by using a new theoretical…
Reynolds' lubrication approximation is used extensively to study flows between moving machine parts, in narrow channels, and in thin films. The solution of Reynolds' equation may be thought of as the zeroth order term in an expansion of the…
In this paper q-ary Raptor codes under ML decoding are considered. An upper bound on the probability of decoding failure is derived using the weight enumerator of the outer code, or its expected weight enumerator if the outer code is drawn…
It is shown that the ratio between the expected diameter of an L2-bounded martingale and the standard deviation of its last term cannot exceed sqrt(3). Moreover, a one-parameter family of stopping times on standard Brownian Motion is…
In this paper, we give an asymptotic formula for the second moment of Dirichlet twists of an automorphic $L$-function $L(s, \pi)$ on the critical line averaged over characters and conductors, where $\pi$ denotes an irreducible tempered…
We establish general moment estimates for the discrete and continuous exit times of a general It\^o process in terms of the distance to the boundary. These estimates serve as intermediate steps to obtain strong convergence results for the…
In the successive refinement problem, a fixed-length sequence emitted from an information source is encoded into two codewords by two encoders in order to give two reconstructions of the sequence. One of two reconstructions is obtained by…
Raptor code ensembles with linear random outer codes in a fixed-rate setting are considered. An expression for the average distance spectrum is derived and this expression is used to obtain the asymptotic exponent of the weight…
We define the error exponent of the typical random code as the long-block limit of the negative normalized expectation of the logarithm of the error probability of the random code, as opposed to the traditional random coding error exponent,…
In successive refinement of information, the decoder refines its representation of the source progressively as it receives more encoded bits. The rate-distortion region of successive refinement describes the minimum rates required to attain…
A new approach for estimating the Decoding Error-Probability (DEP) of LT codes with dense rows is derived by using the conditional Kovalenko's rank distribution. The estimate by the proposed approach is very close to the DEP approximated by…
In practice, we often encounter situations where a sample size is not defined in advance and can be a random value. The randomness of the sample size crucially changes the asymptotic properties of the underlying statistic. In the present…
We study the problem of differentially private (DP) mechanisms for representing sets of size $k$ from a large universe. Our first construction creates $(\epsilon,\delta)$-DP representations with error probability of $1/(e^\epsilon + 1)$…
We investigate the second moment of a random sampling $\zeta(1/2+iX_t)$ of the Riemann zeta function on the critical line. Our main result states that if $X_t$ is an increasing random sampling with gamma distribution, then for all…
We study the first- and second-order asymptotics of covert communication over binary-input DMC for three different covertness metrics and under maximum probability of error constraint. When covertness is measured in terms of the relative…
It is shown that the two-part Minimum Description Length Principle can be used to discriminate among different models that can explain a given observed dataset. The description length is chosen to be the sum of the lengths of the message…
Conrey and Ghosh studied the second moment of the Riemann zeta function, evaluated at its local extrema along the critical line, finding the leading order behaviour to be $\frac{e^2 - 5}{2 \pi} T (\log T)^2$. This problem is closely related…
We consider the moment space $\mathcal{M}_n^{K}$ corresponding to $p \times p$ complex matrix measures defined on $K$ ($K=[0,1]$ or $K=\D$). We endow this set with the uniform law. We are mainly interested in large deviations principles…
We estimate the variance of weight and stopping set distribution of regular LDPC ensembles. Using this estimate and the second moment method we obtain bounds on the probability that a randomly chosen code from regular LDPC ensemble has its…