This paper appears in: Information Theory, IEEE Transactions on
Publication Date: Mar 1988
Volume: 34,
Issue: 2
On page(s): 176-180
ISSN: 0018-9448
References Cited: 4
CODEN: IETTAW
INSPEC Accession Number: 3232590
Digital Object Identifier: 10.1109/18.2626
Posted online: 2002-08-06 15:50:52.0
Abstract
A broadcast network of N+1 nodes is considered in which
each binary digit transmitted by each node is received by every 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 communication from each node. Communicating all the
node states to one node can be accomplished with only marginally more
communication
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
