For finite-alphabet independent and identically distributed random variables, fixed and , every epsilon-sufficient set of length- words satisfies for sufficiently large . Intersect with a typical set whose excluded mass is at most . The intersection retains that much probability and each word has probability at most .
Articles by others on the same topic
There are currently no matching articles.