Lecture - 19 Data Compression
Top Comments
All Comments (13)
-
Thank you very much !!
-
Read the article for huffman coding on wikipedia and you'll learn it much faster.
-
simply awesome!
-
@Akshaylive also, if you solve the equation for levels ( since WEPL is a sum of fi * li and let l12 be the level of node f1 + f2 ) you get 2 equations of l1 - 1 = l12 and l2 - 1 = l12 , which means l1 = l2 => leaves 1 and 2 have the same level
-
There is a simpler explaination for why leaves with smallest frequencies must be siblings. Let leaves be 1 and 2 with frequencies f1 and f2, if they WEREN'T siblings, then the smallest leaf will have some other sibling of frequency f3. (note: all leaves have siblings except root(which should be the basis!).) Anyway, if 1 and 3 were siblings the total weight due to those leaves would be x*(f1+f3).This would have been lesser if we had chosen node 2 instead of node 3 as f2<f3!Proof by contradiction
-
i didnt understand the proof by induction part...someone translate please
-
Best file compression around: “DEL .” = 100% compression ^ ^ trust me
-
was this video made in the early 80s?
the sad part is that it probably wasnt
-
really awesome to watch..!!
very informative
worth the time to watch 5/5
bubzuru 3 years ago 8
Thanks for posting these great videos!
keijigo 3 years ago 6