Shannon’s Noisy-Channel Coding Theorem


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.

View Slides

Cite this paper

@inproceedings{Slot2015ShannonsNC, title={Shannon’s Noisy-Channel Coding Theorem}, author={Lucas Slot and Sebastian Zur}, year={2015} }