Example: tourism industry

Lecture 17: Huffman Coding - home.cse.ust.hk

60 1+5 3+30 2+5 3=150 a 25%saving. Remark: We will see later that this is the optimum (lowest cost) prefix code. 8. Optimum Source Coding Problem The problem: Given an alphabet A = fa1;:::;ang with frequency distribution f(ai) find a binary prefix code …

Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Advertisement

Transcription of Lecture 17: Huffman Coding - home.cse.ust.hk

Related search queries