Efficient and Explicit Coding for Interactive Communication

DOI10.1109/FOCS.2011.51MaRDI QIDQ5495041zbMATH OpenFDO

Authors Ran Gelles, Ankur Moitra, Amit Sahai

Publication date 30 July 2014

Published in 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/FOCS.2011.51

Mathematics Subject Classification ID

Network protocols (68M12) Coding theorems (Shannon theory) (94A24)

Cited in

(11)

• Reliable communication over highly connected noisy networks
• Interactive non-malleable codes
• Interactive Coding for Interactive Proofs
• List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise
• Capacity of interactive communication over erasure channels and channels with feedback
• Synchronization strings: channel simulations and interactive coding for insertions and deletions
• Palette-alternating tree codes
• Noisy interactive quantum communication
• Fast interactive coding against adversarial noise
• Distributed CONGEST Algorithms against Mobile Adversaries
• Information dissemination via broadcasts in the presence of adversarial noise

This page was built for publication: Efficient and Explicit Coding for Interactive Communication

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