A simpler derivation of the coding theorem
Information Theory
2012-05-08 v1 math.IT
Abstract
A simple proof for the Shannon coding theorem, using only the Markov inequality, is presented. The technique is useful for didactic purposes, since it does not require many preliminaries and the information density and mutual information follow naturally in the proof. It may also be applicable to situations where typicality is not natural.
Keywords
Cite
@article{arxiv.1205.1389,
title = {A simpler derivation of the coding theorem},
author = {Yuval Lomnitz and Meir Feder},
journal= {arXiv preprint arXiv:1205.1389},
year = {2012}
}