In this code we study the difference between important
%consept of typicality which unraplaceble tool in network information
%theory. There are many definitions of typical sequences in this code we
%study three most common definitions: Weak Typicality, Robust Typicality
%and Strong Typicality.
In this code we generate K sequences each of length n and check which
typicality constrain does each sequence satisfy. We show how the sequnces
are distributed, and compare frequencey of occurence of each sequence.
For detailed definition of typicality refere to Book: Tomas and Cover "Elements
of Information Theory or Book: El Gamal and Kim "Network Information
Theory"