50 search results - page 3 / 10 » On the bit communication complexity of randomized rumor spre... |
IPL
2006
13 years 8 months ago
2006
We investigate the randomized and quantum communication complexity of the HAMMING DISTANCE problem, which is to determine if the Hamming distance between two n-bit strings is no l...
JSAC
2008
13 years 8 months ago
2008
A multiband OFDM transmitter and receiver are presented for underwater communications at low SNR. Compared with a single-band OFDM scheme, the multiband approach leads to a conside...
VTC
2008
IEEE
14 years 2 months ago
2008
IEEE
— With the advent of EXtrinsic Information Transfer (EXIT) charts, we are capable of analyzing, predicting and visually comparing the convergence behaviours of different turbo Mu...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
Abstract. We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Proble...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...