Alert icon
We're changing our privacy policy. This stuff matters.  Learn more  Dismiss

Lecture - 19 Data Compression

Loading...

Sign in or sign up now!
22,899
Loading...
Alert icon
Sign in or sign up now!
Alert icon

Uploaded by on Sep 24, 2008

Lecture Series on Data Structures and Algorithms by Dr. Naveen Garg, Department of Computer Science and Engineering ,IIT Delhi. For more details on NPTEL visit http://nptel.iitm.ac.in

Category:

Education

Tags:

License:

Standard YouTube License

Link to this comment:

Share to:

Top Comments

  • very informative

    worth the time to watch 5/5

  • Thanks for posting these great videos!

see all

All Comments (13)

Sign In or Sign Up now to post a comment!
  • 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..!!

Loading...
0 / 00Unsaved Playlist Return to active list
    1. Your queue is empty. Add videos to your queue using this button:
      or sign in to load a different list.
    Loading...Loading...Saving...
    • Clear all videos from this list
    • Learn more