Source coding with Tsallis entropy

An extension is presented to the source coding theorem traditionally based on the Shannon entropy and later generalised to the Renyi 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.