Towards coding for maximum errors in interactive communication

DOI10.1145/1993636.1993659MaRDI QIDQ5419085zbMATH OpenOpenAlexWikidataFDO

Authors 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)

Recommendations

• Fast interactive coding against adversarial noise
• Interactive error resilience beyond 2/7
• Fast algorithms for interactive coding
• Interactive coding for multiparty protocols
• Toward coding for maximum errors in interactive communication

Cited in

(20)

• Palette-alternating tree codes
• Interactive Coding for Interactive Proofs
• Toward coding for maximum errors in interactive communication
• Interactive coding for multiparty protocols
• Fast interactive coding against adversarial noise
• Reliable communication over highly connected noisy networks
• Efficient Probabilistically Checkable Debates
• Maximal noise in interactive communication over erasure channels and channels with feedback
• Optimal error rates for interactive coding. I: Adaptivity and other settings
• Communication with partial noiseless feedback
• Fast algorithms for interactive coding
• Interactive error resilience beyond 2/7
• Communication and information complexity
• Interactive non-malleable codes
• List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise
• scientific article; zbMATH DE number 3881867 (Why is no real title available?)
• The rate of interactive codes is bounded away from 1
• One-way communication and error-correcting codes
• The cost of fault tolerance in multi-party communication complexity
• 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)