Title :
Source coding and graph entropies
Author :
Alon, Noga ; Orlitsky, Alon
Author_Institution :
Lucent Technol., Bell Labs., Murray Hill, NJ, USA
fDate :
9/1/1996 12:00:00 AM
Abstract :
A sender wants to accurately convey information to a receiver who has some, possibly related, data. We study the expected number of bits the sender must transmit for one and for multiple instances in two communication scenarios and relate this number to the chromatic and Korner (1973) entropies of a naturally defined graph
Keywords :
entropy; graph theory; source coding; Korner entropy; chromatic entropy; communication scenarios; graph entropies; naturally defined graph; receiver; restricted inputs; sender; source coding; Entropy; Probability distribution; Protocols; Random variables; Source coding; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
