Source coding with escort distributions and Rényi entropy bounds
From MaRDI portal
Publication:665308
DOI10.1016/J.PHYSLETA.2009.07.015zbMATH Open1233.94009arXiv1109.3385OpenAlexW2015586056MaRDI QIDQ665308FDOQ665308
Authors: J-F Bercher 
Publication date: 5 March 2012
Published in: Physics Letters. A (Search for Journal in Brave)
Abstract: We discuss the interest of escort distributions and R'enyi entropy in the context of source coding. We first recall a source coding theorem by Campbell relating a generalized measure of length to the R'enyi-Tsallis entropy. We show that the associated optimal codes can be obtained using considerations on escort-distributions. We propose a new family of measure of length involving escort-distributions and we show that these generalized lengths are also bounded below by the R'enyi entropy. Furthermore, we obtain that the standard Shannon codes lengths are optimum for the new generalized lengths measures, whatever the entropic index. Finally, we show that there exists in this setting an interplay between standard and escort distributions.
Full work available at URL: https://arxiv.org/abs/1109.3385
Recommendations
- On a generalized entropy and a coding theorem
- A joint representation of Rényi's and Tsalli's entropy with application in coding theory
- Some coding theorem connected on generalized Renyi's entropy for incomplete power probability distribution \(p^\beta\)
- A coding theorem on generalized \(R\)-norm entropy
- Relative uniformity of sources and the comparison of optimal code costs
Measures of information, entropy (94A17) Coding theorems (Shannon theory) (94A24) Source coding (94A29) Stochastic systems in control theory (general) (93E03)
Cites Work
- The world according to Rényi: Thermodynamics of multifractal systems
- Introduction to Nonextensive Statistical Mechanics
- Tsallis distribution as a standard maximum entropy solution with `tail' constraint
- A coding theorem and Rényi's entropy
- Distributions and channel capacities in generalized statistical mechanics
- Optimal Prefix Codes for Infinite Alphabets With Nonlinear Costs
- Title not available (Why is that?)
- Source Coding for Quasiarithmetic Penalties
- Dual description of nonextensive ensembles
Cited In (10)
- Optimal information, Jensen-RIG function and \(\alpha\)-Onicescu's correlation coefficient in terms of information generating functions
- Simple one-shot bounds for various source coding problems using smooth Rényi quantities
- Entropy approximation in lossy source coding problem
- Differential-escort transformations and the monotonicity of the LMC-Rényi complexity measure
- Tsallis entropy measure of noise-aided information transmission in a binary channel
- Entropy and Source Coding for Integer-Dimensional Singular Random Variables
- A Fixed-Length Source Coding Theorem on Quasi-Probability Space
- Comparison of transfer entropy methods for financial time series
- Upper bounds on Shannon and Rényi entropies for central potentials
- Optimal guessing under nonextensive framework and associated moment bounds
This page was built for publication: Source coding with escort distributions and Rényi entropy bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q665308)
