Introduction to Information and Coding Theory Lecture 5

Abstract

A more precise notation of the typical set would be A(X) or A(PX), since the typical set is defined by the distribution of the r.v. X . However, throughout this lecture we talk only about typical set defined by PX and therefore we allows us to omit it . Theorem 1 (Properties of typical set) Let X be an i.i.d. sequence distributed according to PX(x). For every ǫ > 0 and n sufficiently large, the set A (n) ǫ , has the following properties: 1) if x ∈ A (n) ǫ , then,

Cite this paper

@inproceedings{Permuter2017IntroductionTI, title={Introduction to Information and Coding Theory Lecture 5}, author={Haim H. Permuter and Boris Bakshan and Ronen Peker and Yaniv Nissenboim}, year={2017} }