Science Alert
 
Blue
   
Curve Top
Asian Journal of Applied Sciences
  Year: 2011 | Volume: 4 | Issue: 6 | Page No.: 649-656
DOI: 10.3923/ajaps.2011.649.656
 
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

A Noiseless Coding Theorem Connected with Generalized Renyi’s Entropy of Order α for Incomplete Power Probability Distribution pβ

Satish Kumar and Arun Choudhary

Abstract:
In this study, a new measure, Lβα called average code word length of order α for incomplete power probability distribution pβ has been defined and its relationship with a result of generalized Renyi's entropy has been discussed. Using Lβα , a coding theorem for discrete noiseless channel has been proved.
PDF Fulltext XML References Citation Report Citation
 RELATED ARTICLES:
  •    Generalized Parametric R-norm Information Measure
  •    Adaptive Quantum Lossless Compression
  •    Multilevel Linear Models Analysis using Generalized Maximum Entropy
  •    A Topological Representation of Information: A Heuristic Study
  •    A Coding Theorem for the Information Measure of Order α and of Type β
  •    Forest Harvesting Problem in the Light of the Information Measures
How to cite this article:

Satish Kumar and Arun Choudhary, 2011. A Noiseless Coding Theorem Connected with Generalized Renyi’s Entropy of Order α for Incomplete Power Probability Distribution pβ. Asian Journal of Applied Sciences, 4: 649-656.

DOI: 10.3923/ajaps.2011.649.656

URL: https://scialert.net/abstract/?doi=ajaps.2011.649.656

COMMENT ON THIS PAPER
 
 
 

 

 
 
 
 
 
 
 
 
 

 
 
 
 
 
 
 

Curve Bottom