Subject: 2 questions

From: Porlin Kang <[email-masked]>
Date: Wed, 9 Apr 1997 13:20:46 -0400 (EDT)

Dr Rose,

On page 99 of the text,
there is a statement that says :

(roughly in the middle)
o The two longest codewords differ ....
  ....
    ...
  ....
    Now we can exchange the longest lenght codewords so the two lowest prob
  are associated with 2 siblings on the tree. This does not change the expected
  length ....

My question is : how could the reassigment of probability with the codewords
not change the expected length ? Shouldn't it be decreased ?

------------------

Somehow we skipped the proof of the Kraft's infinite source Uniquely decodable.
Did you mentioned that you don't like the proof in the book ?

thanks
/pl