Related papers: Analysis of the Second Moment of the LT Decoder

In this paper we propose a new design of LT codes, which decreases the amount of necessary overhead in comparison to existing designs. The design focuses on a parameter of the LT decoding process called the ripple size. This parameter was…

We derive the optimum second-order coding rates, known as second-order capacities, for erasure and list decoding. For erasure decoding for discrete memoryless channels, we show that second-order capacity is $\sqrt{V}\Phi^{-1}(\epsilon_t)$…

Let $\pi$ be a Hecke cusp form for $\mathrm{SL}_3(\mathbb{Z})$. We bound the second moment average of $L(s,\pi)$ over a short interval to obtain the subconvexity estimate $$ L(1/2+it, \pi) \ll_{\pi, \varepsilon}…

This paper studies random-coding error exponents of randomised list decoding, in which the decoder randomly selects $L$ messages with probabilities proportional to the decoding metric of the codewords. The exponents (or bounds) are given…

Let $L_n$ be the length of the longest common subsequence of two independent i.i.d. sequences of Bernoulli variables of length $n$. We prove that the order of the standard deviation of $L_n$ is $\sqrt{n}$, provided the parameter of the…

Some new results are derived concerning random coding error exponents and expurgated exponents for list decoding with a deterministic list size $L$. Two asymptotic regimes are considered, the fixed list-size regime, where $L$ is fixed…

This paper studies the first moment of symmetric-square $L$-functions at the critical point in the weight aspect. Asymptotics with the best known error term $O(k^{-1/2})$ were obtained independently by Fomenko in 2005 and by Sun in 2013. We…

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…

Let $f$ be a holomorphic Hecke cusp form of weight $k$ for $\mathrm{SL}_2(\mathbb{Z})$, and let $(\lambda_f(n))_{n\geq 1}$ denote its sequence of normalised Hecke eigenvalues. We compute the first and second moments of the sums…

Variable-length compression without prefix-free constraints and with side-information available at both encoder and decoder is considered. Instead of requiring the code to be error-free, we allow for it to have a non-vanishing error…

In an unreliable single-hop broadcast network setting, we investigate the throughput and decoding-delay performance of random linear network coding as a function of the coding window size and the network size. Our model consists of a source…

We study the third moment of quadratic Dirichlet L-functions, obtaining an error term of size $O(X^{3/4 + \varepsilon})$.

We make use of the chiral two-loop representation of the pi K scattering amplitude [J. Bijnens, P. Dhonte and P. Talavera, JHEP 0405 (2004) 036] to investigate the isospin odd scattering length at next-to-next-to-leading order in the SU(3)…

We consider the classical sequential binary hypothesis testing problem in which there are two hypotheses governed respectively by distributions $P_0$ and $P_1$ and we would like to decide which hypothesis is true using a sequential test. It…

We consider linear two-time-scale stochastic approximation algorithms driven by martingale noise. Recent applications in machine learning motivate the need to understand finite-time error rates, but conventional stochastic approximation…

This work studies the deviations of the error exponent of the constant composition code ensemble around its expectation, known as the error exponent of the typical random code (TRC). In particular, it is shown that the probability of…

In this paper we analyze LT and Raptor codes under inactivation decoding. A first order analysis is introduced, which provides the expected number of inactivations for an LT code, as a function of the output distribution, the number of…

Second-order coding rate of channel coding is discussed for general sequence of channels. The optimum second-order transmission rate with a constant error constraint $\epsilon$ is obtained by using the information spectrum method. We apply…

In Part II we show that there exist quantum codes whose probability of undetected error falls exponentially with the length of the code and derive bounds on this exponent.The lower (existence) bound for stabilizer codes is proved by a…

We consider error decoding of locally repairable codes (LRC) and partial MDS (PMDS) codes through interleaved decoding. For a specific class of LRCs we investigate the success probability of interleaved decoding. For PMDS codes we show that…