Finding parity in a simple broadcast network

DOI10.1109/18.2626MaRDI QIDQ3495181zbMATH OpenOpenAlexFDO

Authors Robert G. Gallager

Publication date 1988

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/06ac167f68a2e85ff4feb8ef9e70c1cb13d998c0

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40)

Cited in

(11)

• Reliable communication over highly connected noisy networks
• Noisy beeping networks
• Finding OR in a noisy broadcast network
• Computing in fault tolerant broadcast networks and noisy decision trees
• RELIABLE INTERNET-BASED MASTER-WORKER COMPUTING IN THE PRESENCE OF MALICIOUS WORKERS
• Making polynomials robust to noise
• Limits for rumor spreading in stochastic populations
• Algorithms for noisy broadcast with erasures
• Worst-case asymmetric distributed function computation
• Information dissemination via broadcasts in the presence of adversarial noise
• Computation over the noisy broadcast channel with malicious parties

This page was built for publication: Finding parity in a simple broadcast network

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