Title
A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels
Abstract
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 simulated over the channel, using a deterministic coding scheme. In contrast to other interactive capacity definitions in the literature, this definition makes no assumptions on the order of speakers (which can be adapt...
Year
DOI
Venue
2021
10.1109/TIT.2021.3104964
IEEE Transactions on Information Theory
Keywords
DocType
Volume
Protocols,Games,Noise measurement,Channel coding,Error probability,Reliability theory,Channel models
Journal
67
Issue
ISSN
Citations 
12
0018-9448
0
PageRank 
References 
Authors
0.34
0
4
Name
Order
Citations
PageRank
Assaf Ben-yishai1324.63
Young-Han Kim285683.56
Or Ordentlich312118.37
Ofer Shayevitz415826.41