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 Körner entropies of a naturally defined graph.
| Original language | English |
|---|---|
| Pages (from-to) | 1329-1339 |
| Number of pages | 11 |
| Journal | IEEE Transactions on Information Theory |
| Volume | 42 |
| Issue number | 5 |
| DOIs | |
| State | Published - 1 Dec 1996 |
| Externally published | Yes |
Keywords
- Amortization
- Chromatic entropy
- Graph entropy
- Source coding
ASJC Scopus subject areas
- Information Systems
- Computer Science Applications
- Library and Information Sciences
Fingerprint
Dive into the research topics of 'Source coding and graph entropies'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver