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

DOI10.1109/TIT.2019.2904576MaRDI QIDQ5224035zbMATH OpenOpenAlexWikidataFDO

Authors Ran Gelles, Yael Kalai

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)

Cited in

(4)

• Noisy beeping networks
• Constant-Rate Coding for Multiparty Interactive Communication Is Impossible
• scientific article; zbMATH DE number 6866311 (Why is no real title available?)
• Information dissemination via broadcasts in the presence of adversarial noise

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5224035)