Comments on the theorem

• What do the two inequalities tell us?

  • • The number of bits that we need to specify outcomes x with vanishingly small error probability ? does not exceed H + ?
    • If we accept a vanishingly small error, the number of bits we need to specify x drops from NHo(X) to N(H + ?)
  • • The number of bits that we need to specify outcomes x with large allowable error probability ? is at least H – ?

Previous slide

Next slide

Back to first slide

View graphic version