Interactive coding for multiparty protocols

DOI10.1145/2688073.2688109zbMATH Open1366.68044OpenAlexW2123903520MaRDI QIDQ2989009FDOQ2989009

Allison Bishop Lewko, Abhishek Jain, Yael Tauman Kalai

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

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

zbMATH Keywords

multiparty computationinteractive coding

Mathematics Subject Classification ID

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

Cited In (9)

• Noisy beeping networks
• Palette-alternating tree codes
• Making asynchronous distributed computations robust to noise
• Reliable communication over highly connected noisy networks
• Open Multiparty Interaction
• Interactive non-malleable codes
• Title not available (Why is that?)
• Making Asynchronous Distributed Computations Robust to Channel Noise
• Distributed computations in fully-defective networks

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)