Reliable communication over highly connected noisy networks
type: Item
instance of: scholarly article
title: Reliable communication over highly connected noisy networks
zbMATH Open document ID: 1452.68016
author: Noga Alon
author: Mark Braverman
author: Klim Efremenko
author: Ran Gelles
author: Bernhard Haeupler
published in: Distributed Computing
publication date: 2019-11-27T00:00:00Z
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68M12
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68P30
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 7137739
zbMATH Keywords: coding theory
zbMATH Keywords: random noise
zbMATH Keywords: interactive coding
zbMATH Keywords: computation with noise
MaRDI profile type: Publication
full work available at URL: s00446-017-0303-5
OpenAlex ID: W2619994604
cites work: The linear arboricity of graphs
cites work: Reliable Communication over Highly Connected Noisy Networks
cites work: Q3503433
cites work: Fast Interactive Coding against Adversarial Noise
cites work: Fast Algorithms for Interactive Coding
cites work: List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise
cites work: Constant-rate coding for multiparty interactive communication is impossible
cites work: Towards coding for maximum errors in interactive communication
cites work: Toward Coding for Maximum Errors in Interactive Communication
cites work: Existence and Construction of Edge-Disjoint Paths on Expander Graphs
cites work: Optimal Construction of Edge-Disjoint Paths in Random Graphs
cites work: Deterministic Algorithms for the Lovász Local Lemma
cites work: Size biased couplings and the spectral gap for random regular graphs
cites work: Elements of Information Theory
cites work: “Tri, Tri Again”: Finding Triangles and Small Subgraphs in a Distributed Setting
cites work: Maximal Noise in Interactive Communication Over Erasure Channels and Channels With Feedback
cites work: Q4074927
cites work: Optimal Coding for Streaming Authentication and Interactive Communication
cites work: Finding parity in a simple broadcast network
cites work: Coding for Interactive Communication: A Survey
cites work: Capacity of Interactive Communication over Erasure Channels and Channels with Feedback
cites work: Efficient and Explicit Coding for Interactive Communication
cites work: Efficient Coding for Interactive Communication
cites work: Private interactive communication across an adversarial channel
cites work: Optimal error rates for interactive coding I
cites work: Lower Bounds for the Noisy Broadcast Problem
cites work: Linear-Time Encodable/Decodable Codes With Near-Optimal Rate
cites work: The Adversarial Noise Threshold for Distributed Protocols
cites work: Interactive Coding for Multiparty Protocols
cites work: Interactive channel capacity
cites work: Optimal deterministic routing and sorting on the congested clique
cites work: A constructive proof of the general lovász local lemma
cites work: A coding theorem for distributed computation
cites work: Q4228447
cites work: Deterministic coding for interactive communication
cites work: Coding for interactive communication
cites work: A Mathematical Theory of Communication
cites work: Q4234087
cites work: The spectral gap of dense random regular graphs
DOI: 10.1007/S00446-017-0303-5
description: scientific article; zbMATH DE number 7137739