MacKay - Information Theory, Inference, and Learning Algorithms - Cambridge University Press 2003 - Accessed via http://www. inference.phy.cam.ac.uk/itprnn/book.pdf
- J. C. David
In information theory, Shannon’s Noisy-Channel Coding Theorem states that it is possible to communicate over a noisy channel with arbitrarily small chance of error when the rate of communication is kept below a maximum which is constant for a channel. In this report we will first provide some basic concepts surrounding communication over noisy channels and then give a rigorous proof of the theorem. In conclusion we will provide some thoughts on practical applications of the theorem.