Queries about huffman algorithim.

[Aasim Bashir]

Good evening sir. Sir i am not getting the Huffman algorithm exactly. The problem i am facing with this algorithm is that how to calculate "Self information" in its example. I have tried every thing, i have also searched the internet, you-tube etc. But the result i obtain from the source is some tree like structures. I cant find the way to solve this and how to get the result. The file is attached with this.

Regards.

Aasim Bashir.  

[Nik'B]

Dear Aasim

   If you remember, Self- information of any symbol x is defined as  I(x) = log2(1/p(x))
it means, it does not depend on CODES, or huffman codes. It says how many bits it should be given

In short: you just need to know probability of symbol x to find its self information, that's given in question (mostly)

Refer to Lec-2 Handouts, example after self -information

I hope it clarifies your doubt.
by the way attached chapter on Huffman is quite good.