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

IEEE Transactions on Information Theory(2019)

引用 23|浏览41
暂无评分
摘要
Multiparty interactive coding allows a network of n parties to perform distributed computations when the communication channels suffer from noise. Previous results (Rajagopalan and Schulman, STOC 1994) obtained a multiparty interactive coding protocol, resilient to random noise, with a blowup of O(log(A + 1)) for networks whose topology has a maximal degree Δ. Vitally, the communication model in t...
更多
查看译文
关键词
Encoding,Task analysis,Protocols,Noise measurement,Adaptation models,Complexity theory,Network topology
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要