Reliable communication over highly connected noisy networks
From MaRDI portal
Publication:2010609
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)
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
Cites work
- scientific article; zbMATH DE number 3492718 (Why is no real title available?)
- scientific article; zbMATH DE number 1256711 (Why is no real title available?)
- scientific article; zbMATH DE number 1263215 (Why is no real title available?)
- A Mathematical Theory of Communication
- A coding theorem for distributed computation
- A constructive proof of the general Lovász local lemma
- Capacity of interactive communication over erasure channels and channels with feedback
- Coding for interactive communication
- Coding for interactive communication: a survey
- Constant-rate coding for multiparty interactive communication is impossible
- Deterministic algorithms for the Lovász local lemma
- Deterministic coding for interactive communication
- Efficient Coding for Interactive Communication
- Efficient and Explicit Coding for Interactive Communication
- Elements of Information Theory
- Existence and Construction of Edge-Disjoint Paths on Expander Graphs
- Fast algorithms for interactive coding
- Fast interactive coding against adversarial noise
- Finding parity in a simple broadcast network
- Interactive channel capacity
- Interactive coding for multiparty protocols
- Linear-Time Encodable/Decodable Codes With Near-Optimal Rate
- List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise
- Lower Bounds for the Noisy Broadcast Problem
- Maximal Noise in Interactive Communication Over Erasure Channels and Channels With Feedback
- Optimal Coding for Streaming Authentication and Interactive Communication
- Optimal Construction of Edge-Disjoint Paths in Random Graphs
- Optimal coding for streaming authentication and interactive communication
- Optimal deterministic routing and sorting on the congested clique
- Optimal error rates for interactive coding. I: Adaptivity and other settings
- Private interactive communication across an adversarial channel
- Reliable communication over highly connected noisy networks
- Size biased couplings and the spectral gap for random regular graphs
- The adversarial noise threshold for distributed protocols
- The linear arboricity of graphs
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- The spectral gap of dense random regular graphs
- Toward coding for maximum errors in interactive communication
- Towards coding for maximum errors in interactive communication
- ``Tri, tri again: finding triangles and small subgraphs in a distributed setting (extended abstract)
Cited in
(7)- Noisy beeping networks
- Efficient communication in unknown networks
- The adversarial noise threshold for distributed protocols
- Making asynchronous distributed computations robust to noise
- Reliable communication over highly connected noisy networks
- Tolerating corrupted communication
- Constant-rate coding for multiparty interactive communication is impossible
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)
