Towards coding for maximum errors in interactive communication

DOI10.1145/1993636.1993659zbMATH Open1288.94092OpenAlexW2003497308WikidataQ130992023 ScholiaQ130992023MaRDI QIDQ5419085FDOQ5419085

Mark Braverman, Anup Rao

Publication date: 5 June 2014

Published in: Proceedings of the forty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)

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

zbMATH Keywords

interactive computationerror-correcting codestree codes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Source coding (94A29) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Cited In (12)

• Palette-alternating tree codes
• Interactive Coding for Interactive Proofs
• Reliable communication over highly connected noisy networks
• Efficient Probabilistically Checkable Debates
• Interactive communication with unknown noise rate
• Communication and information complexity
• Interactive non-malleable codes
• List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise
• The rate of interactive codes is bounded away from 1
• The Cost of Fault Tolerance in Multi-Party Communication Complexity
• Fast Interactive Coding against Adversarial Noise
• Interactive function computation via polar coding

This page was built for publication: Towards coding for maximum errors in interactive communication

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