Optimal information velocity over tandem binary erasure channels is characterized for message sizes o(sqrt(k)) via bit-separation and for o(k) with global state information.
A coding theorem for distributed computation
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On the Information Velocity over a Tandem of Erasure Channels
Optimal information velocity over tandem binary erasure channels is characterized for message sizes o(sqrt(k)) via bit-separation and for o(k) with global state information.