Complementary Graph Entropy, AND Product, and Disjoint Union of Graphs
N Charpenay, M Le Treust… - 2023 IEEE International …, 2023 - ieeexplore.ieee.org
In the zero-error Slepian-Wolf source coding problem, the optimal rate is given by the
complementary graph entropy ̄H of the characteristic graph. It has no single-letter formula …
complementary graph entropy ̄H of the characteristic graph. It has no single-letter formula …
Broadcast Function Computation with Complementary Side Information
We consider the function computation problem in a three node network with one encoder
and two decoders. The encoder has access to two correlated sources X and Y. The encoder …
and two decoders. The encoder has access to two correlated sources X and Y. The encoder …