Reliable communication over highly connected noisy networks
From MaRDI portal
Publication:2010609
DOI10.1007/s00446-017-0303-5zbMath1452.68016OpenAlexW2619994604MaRDI QIDQ2010609
Ran Gelles, Klim Efremenko, Noga Alon, Bernhard Haeupler, Mark Braverman
Publication date: 27 November 2019
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-017-0303-5
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) Network protocols (68M12)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- The linear arboricity of graphs
- The spectral gap of dense random regular graphs
- Size biased couplings and the spectral gap for random regular graphs
- A coding theorem for distributed computation
- List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise
- Maximal Noise in Interactive Communication Over Erasure Channels and Channels With Feedback
- Toward Coding for Maximum Errors in Interactive Communication
- Efficient Coding for Interactive Communication
- Private interactive communication across an adversarial channel
- Interactive Coding for Multiparty Protocols
- Coding for interactive communication
- Finding parity in a simple broadcast network
- Linear-Time Encodable/Decodable Codes With Near-Optimal Rate
- Lower Bounds for the Noisy Broadcast Problem
- A constructive proof of the general lovász local lemma
- Optimal Construction of Edge-Disjoint Paths in Random Graphs
- Existence and Construction of Edge-Disjoint Paths on Expander Graphs
- The Adversarial Noise Threshold for Distributed Protocols
- Coding for Interactive Communication: A Survey
- “Tri, Tri Again”: Finding Triangles and Small Subgraphs in a Distributed Setting
- Optimal deterministic routing and sorting on the congested clique
- Deterministic coding for interactive communication
- Optimal error rates for interactive coding I
- Constant-rate coding for multiparty interactive communication is impossible
- Reliable Communication over Highly Connected Noisy Networks
- Capacity of Interactive Communication over Erasure Channels and Channels with Feedback
- Deterministic Algorithms for the Lovász Local Lemma
- Towards coding for maximum errors in interactive communication
- Elements of Information Theory
- Efficient and Explicit Coding for Interactive Communication
- Interactive channel capacity
- Fast Interactive Coding against Adversarial Noise
- Fast Algorithms for Interactive Coding
- Optimal Coding for Streaming Authentication and Interactive Communication
- Optimal Coding for Streaming Authentication and Interactive Communication
