Call for Paper - May 2015 Edition
IJCA solicits original research papers for the May 2015 Edition. Last date of manuscript submission is April 20, 2015. Read More
Source Coding with Renyi's Entropy
IJCA Proceedings on Recent Trends in Electronics and Communication 2013
© 2013 by IJCA Journal
RTEC
Year of Publication: 2013
Arun Choudhary, Satish Kumar and Arvind Kumar. Article: Source Coding with Renyi’s Entropy. IJCA Proceedings on Recent Trends in Electronics and Communication 2013 RTEC:19-22, December 2013. Full text available. BibTeX
@article{key:article,
author = {Arun Choudhary and Satish Kumar and Arvind Kumar},
title = {Article: Source Coding with Renyi’s Entropy},
journal = {IJCA Proceedings on Recent Trends in Electronics and Communication 2013},
year = {2013},
volume = {RTEC},
pages = {19-22},
month = {December},
note = {Full text available}
}
Abstract
A new measure called average code word length of order is defined and its relationship with Renyi's entropy of order is discussed. Using some coding theorems are proved under the condition
References
- Aczel, J. and Daroczy, Z. (1963). Uber Verallgemeinerte quasilineare mittelwerte, die mit Gewichtsfunktionen gebildet sind, Publ. Math. Debrecen, Vol. 10, pp. 171-190.
- Aczel, J. and Daroczy, Z. (1975). On measures of information and their characterizations. Mathematics in Science and Engineering, Vol. 115, Academic Press, New York, London.
- Campbell, L. L. (1965). A coding theorem and Renyi's entropy, Information and Control, Vol. 8, pp. 423-429.
- Ebanks, B. , Sahoo, P. and Sander, W. (1998). Characterizations of information measures, World Scientific Publishing Co. , Inc. , River Edge, NJ.
- Feinstein, A. (1956). Foundation of Information Theory, McGraw Hill, New York.
- Hooda, D. S. and Bhaker, U. S. (1997). A generalized `useful' information measure and coding theorems, Soochow J. Math. , Vol. 23, pp. 53-62.
- Jelinek, F. (1980). Buffer overflow in variable lengths coding of fixed rate sources, IEEE, Vol. 3, pp. 490-501.
- Kapur, J. N. (1967). Generalized entropy of order and type , Maths. Seminar, Delhi, Vol. 4, pp. 78-94.
- Khan, A. B. , Bhat, B. A. and Pirzada, S. (2005). Some Results on a Generalized Useful Information Measure, Journal of Inequalities in Pure and Applied Mathematics, Vol. 6(4), Art. 117.
- Kieffer, J. C. (1979). Variable lengths source coding with a cost depending only on the codeword length, Information and Control, Vol. 41, pp. 136-146.
- Longo, G. (1976). A Noiseless Coding Theorem for Sources Having Utilities, Siam J. Appl. Math. , Vol. 30, pp. 739-748.
- Renyi, A. (1961). On Measure of entropy and information, Proc. 4th Berkeley Symp. Maths. Stat. Prob. , Vol. 1, pp. 547-561.
- Shannon, C. E. (1948). A Mathematical Theory of Communication, Bell System Tech. J. , Vol. 27, pp. 379-423, 623-656.
- Singh, R. P. , Kumar, R. and Tuteja, R. K. (2003). Application of Hölder's Inequality in Information Theory, Information Sciences, Vol. 152, pp. 145-154.