Source coding with Tsallis entropy
François Chapeau‐Blondeau, Agnès Delahaies, David Rousseau
Abstract
François Chapeau‐Blondeau, Agnès Delahaies, David Rousseau
Abstract
An extension is presented to the source coding theorem traditionally based on the Shannon entropy and later generalised to the Rényi entropy. Another possible generalisation is demonstrated, with a lower bound realised by the Tsallis entropy, when the performance is measured by the generalised average coding length which is exhibited, and with the optimal codelengths expressed from the escort probability distribution, also known in nonextensive thermodynamics.
OpenAlex reports 13 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
An extension is presented to the source coding theorem traditionally based on the Shannon entropy and later generalised to the Rényi entropy. Another possible generalisation is demonstrated, with a lower bound realised by the Tsallis entropy, when the performance is measured by the generalised average coding length which is exhibited, and with the optimal codelengths expressed from the escort probability distribution, also known in nonextensive thermodynamics.
Key concepts: Tsallis entropy, Shannon's source coding theorem, Min entropy, Statistical physics, Mathematics, Rényi entropy, Entropy (arrow of time), Maximum entropy thermodynamics