Finding parity in a simple broadcast network

@article{Gallager1988FindingPI,
  title={Finding parity in a simple broadcast network},
  author={Robert G. Gallager},
  journal={IEEE Trans. Information Theory},
  year={1988},
  volume={34},
  pages={176-180}
}
Absfracf -Consider a broadcast network of N + 1 nodes in which each binary digit transmitted by each node is received by each other node via a binary symmetric channel of given transition probability. The errors on these channels are independent over transmitters, receivers, and time. Each node has a binary state, and the problem is to construct a distributed algorithm to find the parity of the set of states with some given reliability. It is shown that this can be done with O(ln(ln N)) bits of… CONTINUE READING
Highly Influential
This paper has highly influenced 18 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 164 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 101 extracted citations

164 Citations

051015'94'99'05'11'17
Citations per Year
Semantic Scholar estimates that this publication has 164 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-2 of 2 references

Open problem presented in the 1984 Workshop on Specific Problems in Communication and Computation sponsored

  • A. El Gamal
  • 1984

Information Theoiy and Reliable Communication

  • R. G. Gallager
  • New York: Wiley,
  • 1968

Similar Papers

Loading similar papers…