Interactive coding for multiparty protocols

DOI10.1145/2688073.2688109MaRDI QIDQ2989009zbMATH OpenOpenAlexFDO

Authors Abhishek Jain, Yael Tauman Kalai, Allison Bishop Lewko

Publication date 19 May 2017

Published in Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2688073.2688109

zbMATH Keywords

interactive codingmultiparty computation

Mathematics Subject Classification ID

Network protocols (68M12) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Interactive error resilience beyond 2/7
• Towards coding for maximum errors in interactive communication
• Fast interactive coding against adversarial noise
• scientific article; zbMATH DE number 6866311
• Fast algorithms for interactive coding

Cited in

(14)

• Making asynchronous distributed computations robust to noise
• Reliable communication over highly connected noisy networks
• Noisy beeping networks
• Interactive non-malleable codes
• Open Multiparty Interaction
• scientific article; zbMATH DE number 6866311 (Why is no real title available?)
• Making Asynchronous Distributed Computations Robust to Channel Noise
• Palette-alternating tree codes
• Interactive error resilience beyond 2/7
• Efficient Multiparty Interactive Coding for Insertions, Deletions, and Substitutions
• Constant-rate coding for multiparty interactive communication is impossible
• Towards coding for maximum errors in interactive communication
• Fast algorithms for interactive coding
• Information dissemination via broadcasts in the presence of adversarial noise

This page was built for publication: Interactive coding for multiparty protocols

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