Skip to content

Author

Varun Jog

We have 1 of 11 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Aug 2026

Tight Information Complexity of the Coin Problem in the Broadcast Model

The characterisation shows that the two information costs can be quite different and identifies three parameter regimes, with optimal protocols based respectively on clean samples, a noisy binary symmetric channel, and an asymmetric $Z$-channel.

H. Kazemi, Varun Jog · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.