相关论文: Universal finitary codes with exponential tails
Let $p$ and $q$ be probability vectors with the same entropy $h$. Denote by $B(p)$ the Bernoulli shift indexed by $\Z$ with marginal distribution $p$. Suppose that $\phi$ is a measure preserving homomorphism from $B(p)$ to $B(q)$. We prove…
As it is known, universal codes, which estimate the entropy rate consistently, exist for stationary ergodic sources over finite alphabets but not over countably infinite ones. We generalize universal coding as the problem of universal…
We study universal compression of sequences generated by monotonic distributions. We show that for a monotonic distribution over an alphabet of size $k$, each probability parameter costs essentially $0.5 \log (n/k^3)$ bits, where $n$ is the…
Strong typicality and the Markov lemma have been used in the proofs of several multiterminal source coding theorems. Since these two tools can be applied to finite alphabets only, the results proved by them are subject to the same…
We prove that finitary isomorphisms with finite expectation exist between Bernoulli shifts over the same free group only if the shifts have the same distribution. This generalizes the integer case result of Schmidt. We provide new proofs of…
Universal source coding at short blocklengths is considered for an exponential family of distributions. The \emph{Type Size} code has previously been shown to be optimal up to the third-order rate for universal compression of all memoryless…
This paper describes universal lossless coding strategies for compressing sources on countably infinite alphabets. Classes of memoryless sources defined by an envelope condition on the marginal distribution provide benchmarks for coding…
A consequence of Ornstein theory is that the infinite entropy flows associated with Poisson processes and continuous-time irreducible Markov chains on a finite number of states are isomorphic as measure-preserving systems. We give an…
We introduce and study the notion of entropy of affine permutations and prove that it coincides with the atomic length associated with the sum of the fundamental weights for a type $A$ affine root system, as defined by the first two…
Motivated from the fact that universal source coding on countably infinite alphabets is not feasible, this work introduces the notion of almost lossless source coding. Analog to the weak variable-length source coding problem studied by Han…
In this paper, we investigate the redundancy of universal coding schemes on smooth parametric sources in the finite-length regime. We derive an upper bound on the probability of the event that a sequence of length $n$, chosen using…
In this paper we consider global $\theta$-curvatures of finite Markov chains with associated means $\theta$ in the spirit of the entropic curvature (based on the logarithmic mean) by Erbar-Maas and Mielke. As in the case of Bakry-\'Emery…
Nourdin et al. [9] established the following universality result: if a sequence of off-diagonal homogeneous polynomial forms in i.i.d. standard normal random variables converges in distribution to a normal, then the convergence also holds…
We show how universal codes can be used for solving some of the most important statistical problems for time series. By definition, a universal code (or a universal lossless data compressor) can compress any sequence generated by a…
In this paper, we study the problem of lossless universal source coding for stationary memoryless sources on countably infinite alphabets. This task is generally not achievable without restricting the class of sources over which…
The finitary isomorphism theorem, due to Keane and Smorodinsky, raised the natural question of how "finite" the isomorphism can be, in terms of moments of the coding radius. More precisely, for which values does there exist an isomorphism…
We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…
This paper deals with the problem of universal lossless coding on a countable infinite alphabet. It focuses on some classes of sources defined by an envelope condition on the marginal distribution, namely exponentially decreasing envelope…
Term Coding asks: given a finite system of term identities $\Gamma$ in $v$ variables, how large can its solution set be on an $n$--element alphabet, when we are free to choose the interpretations of the function symbols? This turns familiar…
Universal compression of patterns of sequences generated by independently identically distributed (i.i.d.) sources with unknown, possibly large, alphabets is investigated. A pattern is a sequence of indices that contains all consecutive…