Related papers: Asymptotic Analysis of Run-Length Encoding
We study the asymptotic behavior of the nonlinear parabolic flows $u_{t}=F(D^2 u^m)$ when $t\ra \infty$ for $m\geq 1$, and the geometric properties for solutions of the following elliptic nonlinear eigenvalue problems: F(D^2 \vp) &+…
The set of all error--correcting block codes over a fixed alphabet with $q$ letters determines a recursively enumerable set of rational points in the unit square with coordinates $(R,\delta)$:= (relative transmission rate, relative minimal…
In this work we study the solutions of the equation $z^pR(z^k)=\alpha$ with nonzero complex $\alpha$, integer $p,k$ and $R(z)$ generating a (possibly doubly infinite) totally positive sequence. It is shown that the zeros of…
Let $R_k(x)$ denote the error incurred by approximating the number of $k$-free integers less than $x$ by $x/\zeta(k)$. It is well known that $R_k(x)=\Omega(x^{\frac{1}{2k}})$, and widely conjectured that…
Given a constant $\alpha>0$, an $n$-vertex graph is called an $\alpha$-expander if every set $X$ of at most $n/2$ vertices in $G$ has an external neighborhood of size at least $\alpha|X|$. Addressing a question posed by Friedman and…
Schalkwijk and Kailath (1966) developed a class of block codes for Gaussian channels with ideal feedback for which the probability of decoding error decreases as a second-order exponent in block length for rates below capacity. This…
Kappa distributions are widely used in space plasma physics to model velocity distribution functions with heavy tails. Parameter estimation in these distributions is, however, complicated by the fact that the kappa distribution does not…
In this paper we study the asymptotic behavior of a random uniform parking function $\pi_n$ of size $n$. We show that the first $k_n$ places $\pi_n(1),\dots,\pi_n(k_n)$ of $\pi_n$ are asymptotically i.i.d. and uniform on $\{1,2,\dots,n\}$,…
We analyze the asymptotic number and typical structure of claw-free graphs at constant edge densities. The first of our main results is a formula for the asymptotics of the logarithm of the number of claw-free graphs of edge density $\gamma…
This paper investigates the size in bits of the LZ77 encoding, which is the most popular and efficient variant of the Lempel-Ziv encodings used in data compression. We prove that, for a wide natural class of variable-length encoders for…
Most of the attention in statistical compression is given to the space used by the compressed sequence, a problem completely solved with optimal prefix codes. However, in many applications, the storage space used to represent the prefix…
We establish a new asymptotic formula for the number of polynomials of degree $n$ with $k$ prime factors over a finite field $\mathbb{F}_q$. The error term tends to $0$ uniformly in $n$ and in $q$, and $k$ can grow beyond $\log n$.…
We consider the $0$-Extension problem, where we are given an undirected graph $\mathcal{G}=(V,E)$ equipped with non-negative edge weights $w:E\rightarrow \mathbb{R}^+$, a collection $ T=\{ t_1,\ldots,t_k\}\subseteq V$ of $k$ special…
We appeal to results from combinatorial random matrix theory to deduce that various random graph $\mathrm{C}^*$-algebras are asymptotically almost surely Kirchberg algebras with trivial $K_1$. This in particular implies that, with high…
This paper characterizes Goppa codes of certain maximal curves over finite fields defined by equations of the form $y^n = x^m + x$. We investigate Algebraic Geometric and quantum stabilizer codes associated with these maximal curves and…
This paper investigates the symbol error probability~(SEP) of point-to-point massive multiple-input multiple-output (MIMO) systems using equally likely PAM, PSK, and square QAM signallings in the presence of transmitter correlation. The…
The following source coding problem was introduced by Birk and Kol: a sender holds a word $x\in\{0,1\}^n$, and wishes to broadcast a codeword to $n$ receivers, $R_1,...,R_n$. The receiver $R_i$ is interested in $x_i$, and has prior…
We propose a purely combinatorial quadratic time algorithm that for any $n$-vertex $P_{k}$-free tournament $T$, where $P_{k}$ is a directed path of length $k$, finds in $T$ a transitive subset of order $n^{\frac{c}{k\log(k)^{2}}}$. As a…
We prove that for $k+1\geq 3$ and $c>(k+1)/2$ w.h.p. the random graph on $n$ vertices, $cn$ edges and minimum degree $k+1$ contains a (near) perfect $k$-matching. As an immediate consequence we get that w.h.p. the $(k+1)$-core of $G_{n,p}$,…
The intriguing and still open question concerning the composition law of $\kappa$-entropy $S_{\kappa}(f)=\frac{1}{2\kappa}\sum_i (f_i^{1-\kappa}-f_i^{1+\kappa})$ with $0<\kappa<1$ and $\sum_i f_i =1$ is here reconsidered and solved. It is…