Binary symmetric channel

A binary symmetric channel (or BSC_p) is a common communications channel model used in coding theory and information theory. In this model, a transmitter wishes to send a bit (a zero or a one), and the receiver will receive a bit. The bit will be "flipped" with a "crossover probability" of p, and otherwise is received correctly. This model can be applied to varied communication channels such as telephone lines or disk drive storage.

The noisy-channel coding theorem applies to BSC_p, saying that information can be transmitted at any rate up to the channel capacity with arbitrarily low error. The channel capacity is ${\displaystyle 1-\operatorname {H} _{\text{b}}(p)}$ bits, where ${\displaystyle \operatorname {H} _{\text{b}}}$ is the binary entropy function. Codes including Forney's code have been designed to transmit information efficiently across the channel.

Definition

A binary symmetric channel with crossover probability ${\displaystyle p}$, denoted by BSC_p, is a channel with binary input and binary output and probability of error ${\displaystyle p}$. That is, if ${\displaystyle X}$ is the transmitted random variable and ${\displaystyle Y}$ the received variable, then the channel is characterized by the conditional probabilities:^[1]

${\displaystyle {\begin{aligned}\operatorname {Pr} [Y=0|X=0]&=1-p\\\operatorname {Pr} [Y=0|X=1]&=p\\\operatorname {Pr} [Y=1|X=0]&=p\\\operatorname {Pr} [Y=1|X=1]&=1-p\end{aligned}}}$

It is assumed that ${\displaystyle 0\leq p\leq 1/2}$. If ${\displaystyle p>1/2}$, then the receiver can swap the output (interpret 1 when it sees 0, and vice versa) and obtain an equivalent channel with crossover probability ${\displaystyle 1-p\leq 1/2}$.

Capacity

The channel capacity of the binary symmetric channel, in bits, is:^[2]

${\displaystyle \ C_{\text{BSC}}=1-\operatorname {H} _{\text{b}}(p),}$

where ${\displaystyle \operatorname {H} _{\text{b}}(p)}$ is the binary entropy function, defined by:^[2]

${\displaystyle \operatorname {H} _{\text{b}}(x)=x\log _{2}{\frac {1}{x}}+(1-x)\log _{2}{\frac {1}{1-x}}}$

Proof[3]

The capacity is defined as the maximum mutual information between input and output for all possible input distributions ${\displaystyle p_{X}(x)}$: ${\displaystyle C=\max _{p_{X}(x)}\left\{\,I(X;Y)\,\right\}}$ The mutual information can be reformulated as ${\displaystyle {\begin{aligned}I(X;Y)&=H(Y)-H(Y|X)\\&=H(Y)-\sum _{x\in \{0,1\}}{p_{X}(x)H(Y|X=x)}\\&=H(Y)-\sum _{x\in \{0,1\}}{p_{X}(x)}\operatorname {H} _{\text{b}}(p)\\&=H(Y)-\operatorname {H} _{\text{b}}(p),\end{aligned}}}$ where the first and second step follows from the definition of mutual information and conditional entropy respectively. The entropy at the output for a given and fixed input symbol (${\displaystyle H(Y|X=x)}$) equals the binary entropy function, which leads to the third line and this can be further simplified. In the last line, only the first term ${\displaystyle H(Y)}$ depends on the input distribution ${\displaystyle p_{X}(x)}$. The entropy of a binary variable is at most 1 bit, and equality is attained if its probability distribution is uniform. It therefore suffices to exhibit an input distribution that yields a uniform probability distribution for the output ${\displaystyle Y}$. For this, note that it is a property of any binary symmetric channel that a uniform probability distribution of the input results in a uniform probability distribution of the output. Hence the value ${\displaystyle H(Y)}$ will be 1 when we choose a uniform distribution for ${\displaystyle p_{X}(x)}$. We conclude that the channel capacity for our binary symmetric channel is ${\displaystyle C_{\text{BSC}}=1-\operatorname {H} _{\text{b}}(p)}$.

Noisy-channel coding theorem

Shannon's noisy-channel coding theorem gives a result about the rate of information that can be transmitted through a communication channel with arbitrarily low error. We study the particular case of ${\displaystyle {\text{BSC}}_{p}}$.

The noise ${\displaystyle e}$ that characterizes ${\displaystyle {\text{BSC}}_{p}}$ is a random variable consisting of n independent random bits (n is defined below) where each random bit is a ${\displaystyle 1}$ with probability ${\displaystyle p}$ and a ${\displaystyle 0}$ with probability ${\displaystyle 1-p}$. We indicate this by writing "${\displaystyle e\in {\text{BSC}}_{p}}$".

What this theorem actually implies is, a message when picked from ${\displaystyle \{0,1\}^{k}}$, encoded with a random encoding function ${\displaystyle E}$, and sent across a noisy ${\displaystyle {\text{BSC}}_{p}}$, there is a very high probability of recovering the original message by decoding, if ${\displaystyle k}$ or in effect the rate of the channel is bounded by the quantity stated in the theorem. The decoding error probability is exponentially small.

Proof

The theorem can be proved directly with a probabilistic method. Consider an encoding function ${\displaystyle E:\{0,1\}^{k}\to \{0,1\}^{n}}$ that is selected at random. This means that for each message ${\displaystyle m\in \{0,1\}^{k}}$, the value ${\displaystyle E(m)\in \{0,1\}^{n}}$ is selected at random (with equal probabilities). For a given encoding function ${\displaystyle E}$, the decoding function ${\displaystyle D:\{0,1\}^{n}\to \{0,1\}^{k}}$ is specified as follows: given any received codeword ${\displaystyle y\in \{0,1\}^{n}}$, we find the message ${\displaystyle m\in \{0,1\}^{k}}$ such that the Hamming distance ${\displaystyle \Delta (y,E(m))}$ is as small as possible (with ties broken arbitrarily). (${\displaystyle D}$ is called a maximum likelihood decoding function.)

The proof continues by showing that at least one such choice ${\displaystyle (E,D)}$ satisfies the conclusion of theorem, by integration over the probabilities. Suppose ${\displaystyle p}$ and ${\displaystyle \epsilon }$ are fixed. First we show that, for a fixed ${\displaystyle m\in \{0,1\}^{k}}$ and ${\displaystyle E}$ chosen randomly, the probability of failure over ${\displaystyle {\text{BSC}}_{p}}$ noise is exponentially small in n. At this point, the proof works for a fixed message ${\displaystyle m}$. Next we extend this result to work for all messages ${\displaystyle m}$. We achieve this by eliminating half of the codewords from the code with the argument that the proof for the decoding error probability holds for at least half of the codewords. The latter method is called expurgation. This gives the total process the name random coding with expurgation.

Continuation of proof (sketch)

Fix ${\displaystyle p}$ and ${\displaystyle \epsilon }$. Given a fixed message ${\displaystyle m\in \{0,1\}^{k}}$, we need to estimate the expected value of the probability of the received codeword along with the noise does not give back ${\displaystyle m}$ on decoding. That is to say, we need to estimate: ${\displaystyle \mathbb {E} _{E}\left[\Pr _{e\in {\text{BSC}}_{p}}[D(E(m)+e)\neq m]\right].}$ Let ${\displaystyle y}$ be the received codeword. In order for the decoded codeword ${\displaystyle D(y)}$ not to be equal to the message ${\displaystyle m}$, one of the following events must occur: ${\displaystyle y}$ does not lie within the Hamming ball of radius ${\displaystyle (p+\epsilon )n}$ centered at ${\displaystyle E(m)}$. This condition is mainly used to make the calculations easier. There is another message ${\displaystyle m'\in \{0,1\}^{k}}$ such that ${\displaystyle \Delta (y,E(m'))\leqslant \Delta (y,E(m))}$. In other words, the errors due to noise take the transmitted codeword closer to another encoded message. We can apply the Chernoff bound to ensure the non occurrence of the first event; we get: ${\displaystyle Pr_{e\in {\text{BSC}}_{p}}[\Delta (y,E(m))>(p+\epsilon )n]\leqslant 2^{-{\epsilon ^{2}}n}.}$ This is exponentially small for large ${\displaystyle n}$ (recall that ${\displaystyle \epsilon }$ is fixed). For the second event, we note that the probability that ${\displaystyle E(m')\in B(y,(p+\epsilon )n)}$ is ${\displaystyle {\text{Vol}}(B(y,(p+\epsilon )n)/2^{n}}$ where ${\displaystyle B(x,r)}$ is the Hamming ball of radius ${\displaystyle r}$ centered at vector ${\displaystyle x}$ and ${\displaystyle {\text{Vol}}(B(x,r))}$ is its volume. Using approximation to estimate the number of codewords in the Hamming ball, we have ${\displaystyle {\text{Vol}}(B(y,(p+\epsilon )n))\approx 2^{H(p)n}}$. Hence the above probability amounts to ${\displaystyle 2^{H(p)n}/2^{n}=2^{H(p)n-n}}$. Now using the union bound, we can upper bound the existence of such an ${\displaystyle m'\in \{0,1\}^{k}}$ by ${\displaystyle \leq 2^{k+H(p)n-n}}$ which is ${\displaystyle 2^{-\Omega (n)}}$, as desired by the choice of ${\displaystyle k}$.

Continuation of proof (detailed)

From the above analysis, we calculate the probability of the event that the decoded codeword plus the channel noise is not the same as the original message sent. We shall introduce some symbols here. Let ${\displaystyle p(y|E(m))}$ denote the probability of receiving codeword ${\displaystyle y}$ given that codeword ${\displaystyle E(m)}$ was sent. Let ${\displaystyle B_{0}}$ denote ${\displaystyle B(E(m),(p+\epsilon )n).}$ ${\displaystyle {\begin{aligned}\Pr _{e\in {\text{BSC}}_{p}}[D(E(m)+e)\neq m]&=\sum _{y\in \{0,1\}^{n}}p(y|E(m))\cdot 1_{D(y)\neq m}\\&\leqslant \sum _{y\notin B_{0}}p(y|E(m))\cdot 1_{D(y)\neq m}+\sum _{y\in B_{0}}p(y|E(m))\cdot 1_{D(y)\neq m}\\&\leqslant 2^{-{\epsilon ^{2}}n}+\sum _{y\in B_{0}}p(y|E(m))\cdot 1_{D(y)\neq m}\end{aligned}}}$ We get the last inequality by our analysis using the Chernoff bound above. Now taking expectation on both sides we have, ${\displaystyle {\begin{aligned}\mathbb {E} _{E}\left[\Pr _{e\in {\text{BSC}}_{p}}[D(E(m)+e)\neq m]\right]&\leqslant 2^{-{\epsilon ^{2}}n}+\sum _{y\in B_{0}}p(y|E(m))\mathbb {E} [1_{D(y)\neq m}]\\&\leqslant 2^{-{\epsilon ^{2}}n}+\sum _{y\in B_{0}}\mathbb {E} [1_{D(y)\neq m}]&&\sum _{y\in B_{0}}p(y|E(m))\leqslant 1\\&\leqslant 2^{-{\epsilon ^{2}}n}+2^{k+H(p+\epsilon )n-n}&&\mathbb {E} [1_{D(y)\neq m}]\leqslant 2^{k+H(p+\epsilon )n-n}{\text{ (see above)}}\\&\leqslant 2^{-\delta n}\end{aligned}}}$ by appropriately choosing the value of ${\displaystyle \delta }$. Since the above bound holds for each message, we have ${\displaystyle \mathbb {E} _{m}\left[\mathbb {E} _{E}\left[\Pr _{e\in {\text{BSC}}_{p}}\left[D(E(m)+e)\right]\neq m\right]\right]\leqslant 2^{-\delta n}.}$ Now we can change the order of summation in the expectation with respect to the message and the choice of the encoding function ${\displaystyle E}$. Hence: ${\displaystyle \mathbb {E} _{E}\left[\mathbb {E} _{m}\left[\Pr _{e\in {\text{BSC}}_{p}}\left[D(E(m)+e)\right]\neq m\right]\right]\leqslant 2^{-\delta n}.}$ Hence in conclusion, by probabilistic method, we have some encoding function ${\displaystyle E^{*}}$ and a corresponding decoding function ${\displaystyle D^{*}}$ such that ${\displaystyle \mathbb {E} _{m}\left[\Pr _{e\in {\text{BSC}}_{p}}\left[D^{*}(E^{*}(m)+e)\neq m\right]\right]\leqslant 2^{-\delta n}.}$ At this point, the proof works for a fixed message ${\displaystyle m}$. But we need to make sure that the above bound holds for all the messages ${\displaystyle m}$ simultaneously. For that, let us sort the ${\displaystyle 2^{k}}$ messages by their decoding error probabilities. Now by applying Markov's inequality, we can show the decoding error probability for the first ${\displaystyle 2^{k-1}}$ messages to be at most ${\displaystyle 2\cdot 2^{-\delta n}}$. Thus in order to confirm that the above bound to hold for every message ${\displaystyle m}$, we could just trim off the last ${\displaystyle 2^{k-1}}$ messages from the sorted order. This essentially gives us another encoding function ${\displaystyle E'}$ with a corresponding decoding function ${\displaystyle D'}$ with a decoding error probability of at most ${\displaystyle 2^{-\delta n+1}}$ with the same rate. Taking ${\displaystyle \delta '}$ to be equal to ${\displaystyle \delta -{\tfrac {1}{n}}}$ we bound the decoding error probability to ${\displaystyle 2^{-\delta 'n}}$. This expurgation process completes the proof.

Converse of Shannon's capacity theorem

The converse of the capacity theorem essentially states that ${\displaystyle 1-H(p)}$ is the best rate one can achieve over a binary symmetric channel. Formally the theorem states:

The intuition behind the proof is however showing the number of errors to grow rapidly as the rate grows beyond the channel capacity. The idea is the sender generates messages of dimension ${\displaystyle k}$, while the channel ${\displaystyle {\text{BSC}}_{p}}$ introduces transmission errors. When the capacity of the channel is ${\displaystyle H(p)}$, the number of errors is typically ${\displaystyle 2^{H(p+\epsilon )n}}$ for a code of block length ${\displaystyle n}$. The maximum number of messages is ${\displaystyle 2^{k}}$. The output of the channel on the other hand has ${\displaystyle 2^{n}}$ possible values. If there is any confusion between any two messages, it is likely that ${\displaystyle 2^{k}2^{H(p+\epsilon )n}\geq 2^{n}}$. Hence we would have ${\displaystyle k\geq \lceil (1-H(p+\epsilon )n)\rceil }$, a case we would like to avoid to keep the decoding error probability exponentially small.

Codes

Very recently, a lot of work has been done and is also being done to design explicit error-correcting codes to achieve the capacities of several standard communication channels. The motivation behind designing such codes is to relate the rate of the code with the fraction of errors which it can correct.

The approach behind the design of codes which meet the channel capacities of ${\displaystyle {\text{BSC}}}$ or the binary erasure channel ${\displaystyle {\text{BEC}}}$ have been to correct a lesser number of errors with a high probability, and to achieve the highest possible rate. Shannon's theorem gives us the best rate which could be achieved over a ${\displaystyle {\text{BSC}}_{p}}$, but it does not give us an idea of any explicit codes which achieve that rate. In fact such codes are typically constructed to correct only a small fraction of errors with a high probability, but achieve a very good rate. The first such code was due to George D. Forney in 1966. The code is a concatenated code by concatenating two different kinds of codes.

Forney's code

Forney constructed a concatenated code ${\displaystyle C^{*}=C_{\text{out}}\circ C_{\text{in}}}$ to achieve the capacity of the noisy-channel coding theorem for ${\displaystyle {\text{BSC}}_{p}}$. In his code,

• The outer code ${\displaystyle C_{\text{out}}}$ is a code of block length ${\displaystyle N}$ and rate ${\displaystyle 1-{\frac {\epsilon }{2}}}$ over the field ${\displaystyle F_{2^{k}}}$, and ${\displaystyle k=O(\log N)}$. Additionally, we have a decoding algorithm ${\displaystyle D_{\text{out}}}$ for ${\displaystyle C_{\text{out}}}$ which can correct up to ${\displaystyle \gamma }$ fraction of worst case errors and runs in ${\displaystyle t_{\text{out}}(N)}$ time.
• The inner code ${\displaystyle C_{\text{in}}}$ is a code of block length ${\displaystyle n}$, dimension ${\displaystyle k}$, and a rate of ${\displaystyle 1-H(p)-{\frac {\epsilon }{2}}}$. Additionally, we have a decoding algorithm ${\displaystyle D_{\text{in}}}$ for ${\displaystyle C_{\text{in}}}$ with a decoding error probability of at most ${\displaystyle {\frac {\gamma }{2}}}$ over ${\displaystyle {\text{BSC}}_{p}}$ and runs in ${\displaystyle t_{\text{in}}(N)}$ time.

For the outer code ${\displaystyle C_{\text{out}}}$, a Reed-Solomon code would have been the first code to have come in mind. However, we would see that the construction of such a code cannot be done in polynomial time. This is why a binary linear code is used for ${\displaystyle C_{\text{out}}}$.

For the inner code ${\displaystyle C_{\text{in}}}$ we find a linear code by exhaustively searching from the linear code of block length ${\displaystyle n}$ and dimension ${\displaystyle k}$, whose rate meets the capacity of ${\displaystyle {\text{BSC}}_{p}}$, by the noisy-channel coding theorem.

The rate ${\displaystyle R(C^{*})=R(C_{\text{in}})\times R(C_{\text{out}})=(1-{\frac {\epsilon }{2}})(1-H(p)-{\frac {\epsilon }{2}})\geq 1-H(p)-\epsilon }$ which almost meets the ${\displaystyle {\text{BSC}}_{p}}$ capacity. We further note that the encoding and decoding of ${\displaystyle C^{*}}$ can be done in polynomial time with respect to ${\displaystyle N}$. As a matter of fact, encoding ${\displaystyle C^{*}}$ takes time ${\displaystyle O(N^{2})+O(Nk^{2})=O(N^{2})}$. Further, the decoding algorithm described takes time ${\displaystyle Nt_{\text{in}}(k)+t_{\text{out}}(N)=N^{O(1)}}$ as long as ${\displaystyle t_{\text{out}}(N)=N^{O(1)}}$; and ${\displaystyle t_{\text{in}}(k)=2^{O(k)}}$.

Decoding error probability

A natural decoding algorithm for ${\displaystyle C^{*}}$ is to:

• Assume ${\displaystyle y_{i}^{\prime }=D_{\text{in}}(y_{i}),\quad i\in (0,N)}$
• Execute ${\displaystyle D_{\text{out}}}$ on ${\displaystyle y^{\prime }=(y_{1}^{\prime }\ldots y_{N}^{\prime })}$

Note that each block of code for ${\displaystyle C_{\text{in}}}$ is considered a symbol for ${\displaystyle C_{\text{out}}}$. Now since the probability of error at any index ${\displaystyle i}$ for ${\displaystyle D_{\text{in}}}$ is at most ${\displaystyle {\tfrac {\gamma }{2}}}$ and the errors in ${\displaystyle {\text{BSC}}_{p}}$ are independent, the expected number of errors for ${\displaystyle D_{\text{in}}}$ is at most ${\displaystyle {\tfrac {\gamma N}{2}}}$ by linearity of expectation. Now applying Chernoff bound, we have bound error probability of more than ${\displaystyle \gamma N}$ errors occurring to be ${\displaystyle e^{\frac {-\gamma N}{6}}}$. Since the outer code ${\displaystyle C_{\text{out}}}$ can correct at most ${\displaystyle \gamma N}$ errors, this is the decoding error probability of ${\displaystyle C^{*}}$. This when expressed in asymptotic terms, gives us an error probability of ${\displaystyle 2^{-\Omega (\gamma N)}}$. Thus the achieved decoding error probability of ${\displaystyle C^{*}}$ is exponentially small as the noisy-channel coding theorem.

We have given a general technique to construct ${\displaystyle C^{*}}$. For more detailed descriptions on ${\displaystyle C_{\text{in}}}$ and ${\displaystyle C_{\text{out}}}$ please read the following references. Recently a few other codes have also been constructed for achieving the capacities. LDPC codes have been considered for this purpose for their faster decoding time.^[4]

Applications

The binary symmetric channel can model a disk drive used for memory storage: the channel input represents a bit being written to the disk and the output corresponds to the bit later being read. Error could arise from the magnetization flipping, background noise or the writing head making an error. Other objects which the binary symmetric channel can model include a telephone or radio communication line or cell division, from which the daughter cells contain DNA information from their parent cell.^[5]

This channel is often used by theorists because it is one of the simplest noisy channels to analyze. Many problems in communication theory can be reduced to a BSC. Conversely, being able to transmit effectively over the BSC can give rise to solutions for more complicated channels.

See also

• Z channel

Notes

References

• Cover, Thomas M.; Thomas, Joy A. (1991). Elements of Information Theory. Hoboken, New Jersey: Wiley. ISBN 978-0-471-24195-9.
• G. David Forney. Concatenated Codes. MIT Press, Cambridge, MA, 1966.
• Venkat Guruswamy's course on [1] Error-Correcting Codes: Constructions and Algorithms], Autumn 2006.
• MacKay, David J.C. (2003). Information Theory, Inference, and Learning Algorithms. Cambridge University Press. ISBN 0-521-64298-1.
• Atri Rudra's course on Error Correcting Codes: Combinatorics, Algorithms, and Applications (Fall 2007), Lectures 9, 10, 29, and 30.
• Madhu Sudan's course on Algorithmic Introduction to Coding Theory (Fall 2001), Lecture 1 and 2.
• A mathematical theory of communication C. E Shannon, ACM SIGMOBILE Mobile Computing and Communications Review.
• Modern Coding Theory by Tom Richardson and Rudiger Urbanke., Cambridge University Press