There are two possible messages and three channel uses, giving
Conditional on either transmitted message, a decoding error occurs exactly when at least two of the three bits are flipped. The discrete memoryless channel makes these flips independent, each with probability . Their count therefore has a binomial distribution with parameters . Majority-vote decoding of a repetition code gives
Interchanging the two bit values leaves the binary symmetric channel and majority decision unchanged, so as well. Both the maximum conditional error and the average error, for any message prior, are therefore . The probability of correct decoding for each message is . These are finite-block error probabilities; a channel-capacity statement alone would not determine them.

Articles by others on the same topic (0)

There are currently no matching articles.