Finding OR in a noisy broadcast network-Reference-Cited by-同舟云学术

Finding OR in a noisy broadcast network

Published:2000-01 Issue:1-2 Volume:73 Page:69-75
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Feige Uriel,Kilian Joe

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference5 articles.

1. A. El Gamal, Open problem presented at the 1984 Workshop on Specific Problems in Communication and Computation sponsored by Bell Communication Research

2. Finding parity in a simple broadcast network;Gallager;IEEE Trans. Inform. Theory,1988

3. Computing in noisy radio networks;Kushilevich,1998

4. The Theory of Error-Correcting Codes;MacWilliams,1983

5. Open problem presented in invited talk at the Fifth Israel Symposium on Theory of Computing and Systems, Bar Ilan University, Israel;Yao,1997

Cited by 19 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Tight Bounds for General Computation in Noisy Broadcast Networks;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02

2. Noisy Beeps;Proceedings of the 39th Symposium on Principles of Distributed Computing;2020-07-31

3. Radio Network Coding Requires Logarithmic Overhead;2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS);2019-11

4. Explicit Capacity Approaching Coding for Interactive Communication;IEEE Transactions on Information Theory;2018-10

5. Interactive coding over the noisy broadcast channel;Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing;2018-06-20