Coding Theorems on a Non-Additive Generalized Entropy of Havrda-Charvat And Tsallis

Authors

Satish Kumar, Geeta Institute of Management & Technology
Arun Choudhary, Geeta Institute of Management & Technology

Abstract

A new measure L^β_α, called average code word length of order α and type β is defined and its relationship with a generalized information measure of order α and type β is discussed. Using L^β_α , some coding theorems are proved.

Recommended Citation

Kumar, Satish and Choudhary, Arun (2012). Coding Theorems on a Non-Additive Generalized Entropy of Havrda-Charvat And Tsallis, Applications and Applied Mathematics: An International Journal (AAM), Vol. 7, Iss. 1, Article 23.
Available at: https://digitalcommons.pvamu.edu/aam/vol7/iss1/23