Reliable Communication over Highly Connected Noisy Networks

DOI10.1145/2933057.2933085zbMath1373.68033OpenAlexW2483713254MaRDI QIDQ5361931

Ran Gelles, Klim Efremenko, Mark Braverman, Noga Alon, Bernhard Haeupler

Publication date: 29 September 2017

Published in: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

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

zbMATH Keywords

coding theorycommunication complexityrandom noisemultiparty protocolsinteractive coding

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12)

Related Items (9)

Interactive non-malleable codes ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Making Asynchronous Distributed Computations Robust to Channel Noise ⋮ Making asynchronous distributed computations robust to noise ⋮ Reliable communication over highly connected noisy networks ⋮ Capacity of Interactive Communication over Erasure Channels and Channels with Feedback ⋮ Palette-alternating tree codes ⋮ Unnamed Item

This page was built for publication: Reliable Communication over Highly Connected Noisy Networks