IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Minimum Entropy Combinatorial Optimization Problems
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
On complementary graph entropy
IEEE Transactions on Information Theory
On the redundancy of Slepian--Wolf coding
IEEE Transactions on Information Theory
When do only sources need to compute? on functional compression in tree networks
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Distributed joint source-channel coding for functions over a multiple access channel
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Multi-functional compression with side information
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Functional compression through graph coloring
IEEE Transactions on Information Theory
IEEE Transactions on Signal Processing
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Tight results on minimum entropy set cover
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
A genetic algorithm to minimize chromatic entropy
EvoCOP'10 Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization
| Hi-index | 755.02 |
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