Finding parity in a simple broadcast network

DOI10.1109/18.2626zbMath0709.94591OpenAlexW2053269541MaRDI QIDQ3495181

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)

Related Items (9)

Finding OR in a noisy broadcast network ⋮ Worst-case asymmetric distributed function computation ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Reliable communication over highly connected noisy networks ⋮ Computing in fault tolerant broadcast networks and noisy decision trees ⋮ Unnamed Item ⋮ Noisy beeping networks ⋮ RELIABLE INTERNET-BASED MASTER-WORKER COMPUTING IN THE PRESENCE OF MALICIOUS WORKERS

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