lecture_slides-Chapter 2.3

px n 1 p n log n n log n n log n z n as

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: owever, but i H ⇣ 2 PX n ( i ) | = p ! 0. 2 log n PX n ( i ) | = p ! 0. log n ⌘ lim PXn = H (PX ) = 0 n!1 lim H (PXn ) = 1. n!1 lim H (PXn ) = 1. n!1 Thursday, 26 December, 13 An Example • • • • Let X = {1, 2, · · · , }, a countably infinite alphabet. Let X = {1, 2, · · · , }, a countably infinite alphabet. Let PX = {1, 0, 0, · · · }, and let Let PX = {1, 0, 0, · · · }, and let 9 8 > > ⇢ > > < = 1 1 1 ,p ,··· , p , 0, 0, · · · .. PX n = 1 p n > > log n n log n n log n > > : ; | {z } n • As n ! 1, • As n ! 1, X V (PX , PXn ) = X |PX (i) V (PX , PXn ) = i |PX (i) • However, • However, but i H ⇣ 2 PX n ( i ) | = p ! 0. 2 log n PX n ( i ) | = p ! 0. log n ⌘ lim PXn = H (PX ) = 0 n!1 lim H (PXn ) = 1. n!...
View Full Document

This note was uploaded on 01/09/2014 for the course CIS 422 taught by Professor Raymondyeumg during the Spring '14 term at Bingham University.

Ask a homework question - tutors are online