Reliable communication over highly connected noisy networks
DOI10.1007/S00446-017-0303-5zbMATH Open1452.68016OpenAlexW2619994604MaRDI QIDQ2010609FDOQ2010609
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
Recommendations
- Reliable communication over highly connected noisy networks
- Constant-Rate Coding for Multiparty Interactive Communication Is Impossible
- Constant-rate coding for multiparty interactive communication is impossible
- scientific article; zbMATH DE number 6866311
- A coding theorem for distributed computation
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) Network design and communication in computer systems (68M10) Distributed systems (68M14) Network protocols (68M12)
Cites Work
- Elements of Information Theory
- A Mathematical Theory of Communication
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Optimal deterministic routing and sorting on the congested clique
- Title not available (Why is that?)
- Finding parity in a simple broadcast network
- A constructive proof of the general Lovász local lemma
- Title not available (Why is that?)
- Optimal Construction of Edge-Disjoint Paths in Random Graphs
- Coding for interactive communication
- The linear arboricity of graphs
- A coding theorem for distributed computation
- Deterministic Algorithms for the Lovász Local Lemma
- Towards coding for maximum errors in interactive communication
- Linear-Time Encodable/Decodable Codes With Near-Optimal Rate
- Existence and Construction of Edge-Disjoint Paths on Expander Graphs
- Interactive channel capacity
- Deterministic coding for interactive communication
- “Tri, Tri Again”: Finding Triangles and Small Subgraphs in a Distributed Setting
- 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
- Title not available (Why is that?)
- Optimal error rates for interactive coding I
- Efficient and Explicit Coding for Interactive Communication
- Fast Algorithms for Interactive Coding
- Optimal Coding for Streaming Authentication and Interactive Communication
- Size biased couplings and the spectral gap for random regular graphs
- The spectral gap of dense random regular graphs
- 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
- Lower Bounds for the Noisy Broadcast Problem
- The Adversarial Noise Threshold for Distributed Protocols
- Coding for Interactive Communication: A Survey
- 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
- Fast Interactive Coding against Adversarial Noise
- Optimal Coding for Streaming Authentication and Interactive Communication
Cited In (4)
This page was built for publication: Reliable communication over highly connected noisy networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010609)
