scientific article; zbMATH DE number 6866311

DOI10.4230/LIPIcs.ITCS.2017.21zbMath1402.68062MaRDI QIDQ4638071

T. Kalai Yael, Ran Gelles

Publication date: 3 May 2018

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

codingcommunication complexitystochastic noiseinteractive communication

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) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Network protocols (68M12)

Related Items (3)

Interactive non-malleable codes ⋮ Making Asynchronous Distributed Computations Robust to Channel Noise ⋮ Making asynchronous distributed computations robust to noise

Cites Work

• Unnamed Item
• Unnamed Item
• A coding theorem for distributed computation
• Efficient Coding for Interactive Communication
• Interactive Coding for Multiparty Protocols
• Coding for interactive communication
• The Adversarial Noise Threshold for Distributed Protocols
• Coding for Interactive Communication: A Survey
• Optimal error rates for interactive coding I
• Constant-rate coding for multiparty interactive communication is impossible
• Reliable Communication over Highly Connected Noisy Networks
• Interactive channel capacity
• Optimal Coding for Streaming Authentication and Interactive Communication

This page was built for publication: