Binary symmetric channel Created 2026-09-24 Updated 2026-10-14
A binary symmetric channel is a discrete memoryless channel that flips each transmitted bit with fixed crossover probability . For one use, write , where is exclusive or and is a Bernoulli random variable with parameter , independent of the input . Thus preserves the bit and flips it. Different uses have independent noise under this model.
With row labels and column labels , its transition matrix is
Each row sums to one, and exchanging both binary labels leaves the rule unchanged, explaining symmetric. For , a prescribed three-bit input produces with probability and with probability . The received does not itself announce the changed position: it could also arise from input with no flips.
The binary symmetric channel capacity quantifies how well a block code can overcome this uncertainty, and input distribution optimization for a binary symmetric channel shows why a fair input attains the best information rate. A completely noisy binary symmetric channel has and carries no input information; a known flip on every use, , is instead reversible.
A binary symmetric channel independently flips each input bit with probability , so, with rows indexed by the input and columns by the output, its channel matrix is
If , complementing every received bit converts the channel into one with crossover probability without changing its information-carrying ability. The case has identical rows and capacity zero, so it suffices to study .
The Shannon second coding theorem states that for every rate below the channel capacity there are arbitrarily long codes whose decoding error tends to zero, whereas no sequence of codes with rate above capacity can have vanishing error. It also identifies
For the present channel,
The output entropy is at most one bit, with equality for a uniform input. Hence the binary symmetric channel capacity is
bits per channel use.