Preprint
Oct 2026
Graph-Theoretic Bounds for Non-Linear Function Computation Broadcast
This work derives a multi-letter response-profile bound that strengthens a basic side-information converse, zero-error and asymptotically lossless clique-entropy bounds based on the operational block broadcast graph, and a genie-aided lower bound.
Derya Malak, P. VijithKumarK, M. Salehi
· 0 citations