Related papers: Analysis of the Second Moment of the LT Decoder
Numerical simulations and finite-size scaling analysis have been carried out to study the percolation behavior of straight rigid rods of length $k$ ($k$-mers) on two-dimensional square lattices. The $k$-mers, containing $k$ identical units…
We establish the Level-1 and Level-3 Large Deviation Principles (LDPs) for invariant measures on shift spaces over finite alphabets under very general decoupling conditions for which the thermodynamic formalism does not apply. Such…
Assuming the Riemann Hypothesis, Goldston, Gonek and Montgomery \cite{GGM} studied the second moment of the log-derivative of $\zeta$, shifted away from the half line by $a/\log T$, and its connection with the pair correlation conjecture.…
To prove Fourier restriction estimate using polynomial partitioning, Guth introduced the concept of $k$-broad part of regular $L^p$ norm and obtained sharp $k$-broad restriction estimates. To go from $k$-broad estimates to regular $L^p$…
This paper studies the moment boundedness of solutions of linear stochastic delay differential equations with distributed delay. For a linear stochastic delay differential equation, the first moment stability is known to be identical to…
We propose a reduced complexity approach to pattern-based soft decoding of block codes. We start from the ORDEPT decoding algorithm which tests a list of partial error patterns organized in the order of their likelihood and attempts to…
We study variable-length feedback (VLF) codes with noiseless feedback for discrete memoryless channels. We present a novel non-asymptotic bound, which analyzes the average error probability and average decoding time of our modified…
We consider the nodal length $L(\lambda)$ of the restriction to a ball of radius $r_\lambda$ of a {\it Gaussian pullback monochromatic random wave} of parameter $\lambda>0$ associated with a Riemann surface $(\mathcal M,g)$ without…
Using the method of asymptotic sum rules we estimated the size of $O(m_s p_\pi^4)$ and $O(m_s^2 p_\pi^2)$ corrections to $\pi K$ scattering amplitude in large $N_c$ limit. These corrections arise from the sixth order effective chiral…
This paper studies the fundamental limits of the minimum average length of lossless and lossy variable-length compression, allowing a nonzero error probability $\epsilon$, for lossless compression. We give non-asymptotic bounds on the…
The error exponent of the typical random code is defined as the asymptotic normalized expectation of the logarithm of the probability of error, as opposed to the traditional definition of the random coding exponent as the normalized…
We obtain a second moment formula for the L-series of holomorphic cusp forms, averaged over twists by Dirichlet characters modulo a fixed conductor Q. The estimate obtained has no restrictions on Q, with an error term that has a close to…
Equip the edges of the lattice $\mathbb{Z}^2$ with i.i.d. random capacities. A law of large numbers is known for the maximal flow crossing a rectangle in $\mathbb{R}^2$ when the side lengths of the rectangle go to infinity. We prove that…
We study the asymptotic behaviour of the twisted first moment of central $L$-values associated to cusp forms in weight aspect on average. Our estimate of the error term allows extending the logarithmic length of mollifier $\Delta$ up to 2.…
A set of linearly constrained permutation matrices are proposed for constructing a class of permutation codes. Making use of linear constraints imposed on the permutation matrices, we can formulate a minimum Euclidian distance decoding…
We study first-passage percolation on $\mathbb Z ^2$ with independent and identically distributed weights, whose common distribution is uniform on $\{a,b\}$ with $0<a<b<\infty $. Following Ahlberg and De la Riva, we consider the passage…
A simple, recently observed generalization of the classical Singleton bound to list-decoding asserts that rate $R$ codes are not list-decodable using list-size $L$ beyond an error fraction $\frac{L}{L+1} (1-R)$ (the Singleton bound being…
Top-$k$ decoding is a widely used method for sampling from LLMs: at each token, only the largest $k$ next-token-probabilities are kept, and the next token is sampled after re-normalizing them to sum to unity. Top-$k$ and other sampling…
We find the best asymptotic lower bounds for the coefficient of the leading term of the $L_1$ norm of the two-dimensional (axis-parallel) discrepancy that can be obtained by K.Roth's orthogonal function method among a large class of test…
In this paper, we first introduce the concept of elementary linear subspace, which has similar properties to those of a set of coordinates. We then use elementary linear subspaces to derive properties of maximum rank distance (MRD) codes…