List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise

DOI10.1137/141002001zbMath1420.94005OpenAlexW2592971868MaRDI QIDQ2968158

Klim Efremenko, Mark Braverman

Publication date: 10 March 2017

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/141002001

zbMATH Keywords

error-correcting codestree codesinteractive communication

Mathematics Subject Classification ID

Theory of error-correcting codes and error-detecting codes (94B99) Communication theory (94A05)

Related Items (10)

Interactive communication with unknown noise rate ⋮ Synchronization Strings: Channel Simulations and Interactive Coding for Insertions and Deletions ⋮ The work of Mark Braverman ⋮ Making Asynchronous Distributed Computations Robust to Channel Noise ⋮ Making asynchronous distributed computations robust to noise ⋮ Reliable communication over highly connected noisy networks ⋮ Unnamed Item ⋮ Interactive Coding for Interactive Proofs ⋮ Capacity of Interactive Communication over Erasure Channels and Channels with Feedback ⋮ Sparse MDS Matrices over Small Fields: A Proof of the GM-MDS Conjecture

Cites Work

• List decoding of error-correcting codes. Winning thesis of the 2002 ACM Doctoral Dissertation Competition
• Towards deterministic tree code constructions
• Tree codes and a conjecture on exponential sums
• Coding for interactive communication
• Rounds in Communication Complexity Revisited
• Towards Optimal Deterministic Coding for Interactive Communication
• Optimal error rates for interactive coding I
• Towards coding for maximum errors in interactive communication
• Efficient and Explicit Coding for Interactive Communication
• Interactive channel capacity
• Fast Algorithms for Interactive Coding
• Optimal Coding for Streaming Authentication and Interactive Communication

This page was built for publication: List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise