How to use several noisy channels with unknown error probabilities
Consider a sender transmitting a given sequence of bits simultaneously through m binary symmetric channels with error probabilities epsilon(1),..., epsilon(m) such that 0 less than or equal to epsilon(i) < 1/2 for each i = 1,..., m. The receiver can base its guess for the true transmitted bit on the m channel noisy outputs. Knowing the channel error probabilities, the receiver could apply the maximum likelihood estimator (MLE). What if the receiver does not know the channel error probabilities? In the paper, a strategy is derived whose error probability converges to that of the MLE with rate O(rootln(n)/n), where n is the number of bits transmitted so far, whenever m greater than or equal to 3. (C) 2003 Elsevier Science (USA). All rights reserved.
noisy channel maximum likelihood estimator