Communication Complexity of Exact Sampling under Rényi Information

Spencer Hill, Fady Alajaji, Tamás Linder

We study the problem of exact sampling under an exponential communication cost, specifically Campbell's average codeword length $L(t)$ of order $t$, and Rényi's entropy. We provid…