Constant-Rate Interactive Coding Is Impossible, Even in Constant-Degree Networks

DOI10.1109/TIT.2019.2904576zbMath1432.94062OpenAlexW2921287520WikidataQ128294407 ScholiaQ128294407MaRDI QIDQ5224035

Yael Kalai, Ran Gelles

Publication date: 19 July 2019

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2019.2904576

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Coding theorems (Shannon theory) (94A24)

Related Items (2)

Distributed computations in fully-defective networks ⋮ Noisy beeping networks

This page was built for publication: Constant-Rate Interactive Coding Is Impossible, Even in Constant-Degree Networks