The Communication Complexity of the Coin Problem
A $\Omega(\log\log n) bit lower bound for the constant error-rate regime, and a $\Omega(1/\delta)$ bit lower bound for arbitrarily small error rates, as well as a tight one-way protocol using $O(\log\log n + \log(1/\delta))$ bits of communication.