Project 8: Arbitrary Varying Channel

We saw two “extreme” ways of modeling the channel noise in class today. In particular Hamming modeled noise adversarially, where the channel can choose the locations as well as nature of errors arbitrarily subject to a bound on the total number of errors. Shannon on the other hand modeled the noise as a stochastic process. In today’s lecture we saw a special case called Binary Symmetric Channel or , where is the cross over probability. In , every bit is flipped with probability (also the probability of flipping is independent for each bit that is transmitted over the channel).

The two noise models above have been arguably studied the most in coding theory. The Hamming noise model is valid when we have no idea about the channel where as Shannon’s noise model assumes complete knowledge about the channel. Needless to say, in practice the truth is somewhere in between. The goal of this project is to review the literature for channels that lie “in between” the two extremes.