Related papers: Asymptotic Analysis of Run-Length Encoding

In the present effort we consider the most general non linear particle kinetics within the framework of the Fokker-Planck picture. We show that the kinetics imposes the form of the generalized entropy and subsequently we demonstrate the…

We consider the asymptotic distribution of the IP sparsity function, which measures the minimal support of optimal IP solutions, and the IP to LP distance function, which measures the distance between optimal IP and LP solutions. We create…

This paper presents prefix codes which minimize various criteria constructed as a convex combination of maximum codeword length and average codeword length or maximum redundancy and average redundancy, including a convex combination of the…

We study classical invariants for plane curve singularities $f\in K[[x,y]]$, $K$ an algebraically closed field of characteristic $p\geq 0$: Milnor number, delta invariant, kappa invariant and multiplicity. It is known, in characteristic…

If $G$ is a connected semisimple Lie group with finite center and $K$ is a maximal compact subgroup of G, then the Lie algebra of $G$ admits a Cartan decomposition $\mathfrak{g}=\mathfrak{k}\oplus\mathfrak{p}$. This allows us to define the…

This paper investigates the existence of minimal $p$-encoders for convolutional codes over $\mathbb{Z}_{p^r}$, where $p$ is a prime. This addresses a conjecture from \cite{k}, which posits that every such code admits a minimal $p$-encoder,…

Let $E$ be the union of two real intervals not containing zero. Then $L_n^r(E)$ denotes the supremum norm of that polynomial $P_n$ of degree less than or equal to $n$, which is minimal with respect to the supremum norm provided that…

We consider the asymptotic minimum density $f(s,k)$ of monotone $k$-subwords of words over a totally ordered alphabet of size $s$. The unrestricted alphabet case, $f(\infty,k)$, is well-studied, known for $f(\infty,3)$ and $f(\infty,4)$,…

In this paper Raptor code ensembles with linear random precodes 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 a variable-length code having the property that no (non-empty) prefix of each its codeword is a suffix of any other one, and vice versa. This kind of code can be seen as an extension of two well-known codes in literature, called…

Let $\{p_j(n)\}_{j=1}^{\omega(n)}$ denote the increasing sequence of distinct prime factors of an integer $n$. For $z\geqslant 0$, let $G(n;z)$ denote the number of those indexes $j$ such that $p_{j+1}(n)>p_j(n)^{\exp z}$. We show uniform…

A quantum error-correcting code is defined to be a unitary mapping (encoding) of k qubits (2-state quantum systems) into a subspace of the quantum state space of n qubits such that if any t of the qubits undergo arbitrary decoherence, not…

Multiple algorithms are known for efficiently calculating the prefix probability of a string under a probabilistic context-free grammar (PCFG). Good algorithms for the problem have a runtime cubic in the length of the input string. However,…

In the noisy channel model from coding theory, we wish to detect errors introduced during transmission by optimizing various parameters of the code. Bennett, Dudek, and LaForge framed a variation of this problem in the language of…

We obtain an explicit formula for the variance of the number of $k$-peaks in a uniformly random permutation. This is then used to obtain an asymptotic formula for the variance of the length of longest $k$-alternating subsequence in random…

Let $P$ be a probability distribution on $\mathbb{R}^d$ (equipped with an Euclidean norm $|\cdot|$). Let $ r> 0 $ and let $(\alpha_n)_{n \geq1}$ be an (asymptotically) $L^r(P)$-optimal sequence of $n$-quantizers. We investigate the…

Addressing a problem posed by W. Li and A. Wei (2009), we investigate the average number of (complex) zeros of a random harmonic polynomial $p(z) + \overline{q(z)}$ sampled from the Kac ensemble, i.e., where the coefficients are independent…

Let $ \{\varphi_i\}_{i=0}^\infty $ be a sequence of orthonormal polynomials on the unit circle with respect to a positive Borel measure $ \mu $ that is symmetric with respect to conjugation. We study asymptotic behavior of the expected…

We obtain lower bounds for Selmer ranks of elliptic curves over dihedral extensions of number fields. Suppose $K/k$ is a quadratic extension of number fields, $E$ is an elliptic curve defined over $k$, and $p$ is an odd prime. Let $F$…

We prove existence of asymptotic entropy of random walks on regular languages over a finite alphabet and we give formulas for it. Furthermore, we show that the entropy varies real-analytically in terms of probability measures of constant…