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 commun
ication scenarios and relate this number to the chromatic and Korner e
ntropies of a naturally defined graph.