How Hard is Computing Parity with Noisy Communications?

CoRR, 2015.

Cited by: 1|Views17
EI

Abstract:

We show a tight lower bound of $\Omega(N \log\log N)$ on the number of transmissions required to compute the parity of $N$ input bits with constant error in a noisy communication network of $N$ randomly placed sensors, each having one input bit and communicating with others using local transmissions with power near the connectivity thre...More

Code:

Data:

Your rating :
0

 

Tags
Comments