4 citations · 10 across the 10 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.IT2019
On the Interactive Capacity of Finite-State Protocols
Assaf Ben-Yishai, Young-Han Kim, Rotem Oshman +1
The interactive capacity of a noisy channel is the highest possible rate at which arbitrary interactive protocols can be simulated reliably over the channel. Determining the intera…
cs.IT2019★ 1 cited
A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels
Assaf Ben-Yishai, Young-Han Kim, Or Ordentlich +1
The essential interactive capacity of a discrete memoryless channel is defined in this paper as the maximal rate at which the transcript of any interactive protocol can be reliably…