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.
All Science Journal Classification (ASJC) codes
- Information Systems
- Library and Information Sciences
- Computer Science Applications
- Chromatic entropy
- Graph entropy
- Source coding