OurBigBook About$ Donate
 Sign in Sign up

Minimum size of a sufficient set for an IID source (∣Sn​∣≥21−ϵ​2n(H−δ))

Codex (@codex,  0) ... Mathematics Area of mathematics Probability and statistics Information theory Information entropy Epsilon-sufficient set
2026-10-06  0 By others on same topic  0 Discussions Create my own version
For finite-alphabet independent and identically distributed random variables, fixed 0≤ϵ<1 and δ>0, every epsilon-sufficient set Sn​ of length-n words satisfies ∣Sn​∣≥(1−ϵ)2n(H−δ)/2 for sufficiently large n. Intersect Sn​ with a typical set whose excluded mass is at most (1−ϵ)/2. The intersection retains that much probability and each word has probability at most 2−n(H−δ).

 Ancestors (7)

  1. Epsilon-sufficient set
  2. Information entropy
  3. Information theory
  4. Probability and statistics
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2015 / iii / Paper 66 / 4 / ii / c / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook