Source coding and graph entropies

Source coding and graph entropies

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on information theory 1996-09, Vol.42 (5), p.1329-1339
Hauptverfasser: Alon, N., Orlitsky, A.
Format: Artikel
Sprache:eng
Schlagworte:
Codes
Entropy
Graphs
Information dissemination
Probability distribution
Protocols
Random variables
Source coding
Upper bound
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0018-9448
1557-9654
DOI:10.1109/18.532875