Algorithms for noisy broadcast with erasures

DOI10.4230/LIPICS.ICALP.2018.153MaRDI QIDQ5002843zbMATH OpenFDO

Authors Ofer Grossman, Bernhard Haeupler, Sidhanth Mohanty

Publication date 28 July 2021

Full work available at URL https://arxiv.org/abs/1808.00838

zbMATH Keywords

distributed computing with noiseerasureserror correctionnoisy broadcast

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Recommendations

• Lower Bounds for the Noisy Broadcast Problem
• Interactive coding over the noisy broadcast channel
• Finding OR in a noisy broadcast network
• scientific article; zbMATH DE number 1303562
• Computation in Noisy Radio Networks

Cites work

• A coding theorem for distributed computation
• Brief announcement: A hierarchy of congested clique models, from broadcast to unicast
• Class of constructive asymptotically good algebraic codes
• Computing with Noisy Information
• Constant-Rate Coding for Multiparty Interactive Communication Is Impossible
• Finding OR in a noisy broadcast network
• Finding parity in a simple broadcast network
• scientific article; zbMATH DE number 1303562 (Why is no real title available?)
• Lower Bounds for the Noisy Broadcast Problem
• On the power of the congested clique model
• Reliable communication over highly connected noisy networks

Cited in

(2)

• Finding OR in a noisy broadcast network
• Lower Bounds for the Noisy Broadcast Problem

This page was built for publication: Algorithms for noisy broadcast with erasures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5002843)