On Noiseless Coding
Prem Nath · Journal of Information and Optimization Sciences · 1984
During the past few years, several additive and non-additive generalizations of the Shannon entropy have been given. The generalizations due to Renyi (1960) and Havrda and Charvat (1967) have proved to be of considerable interest. A measure of entropy can be of some use in probabilistic coding theory if it gives rise to a Shannon-Fano type theorem. Based upon this pragmatic point of view, the author has introduced a new concept of “Admissible Measures of Code Length”. It is also shown that, in general, a coding theorem need not lead to a Shannon-Fano type theorem.