The interactive capacity of every binary memoryless symmetric channel is at least 0.0302 times its Shannon capacity, achieved by a deterministic rewind-if-error coding scheme.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels
The interactive capacity of every binary memoryless symmetric channel is at least 0.0302 times its Shannon capacity, achieved by a deterministic rewind-if-error coding scheme.