Worked Example: Huffman Encoding | Computation Structures | Electrical Engineering and Computer Science | MIT OpenCourseWare

ロータリーエンコーダを使うpart 3 : “Dual Encoder”

(20 pts.) Huffman Encoding. We use Huffman's algorithm to obtain an encoding of alphabet {a,b,c} with frequencies fa, fb, fc. In each of the following cases, either give an example of a specific set of frequencies fa, fb, fc that would yield the specified encoding or explain why the code cannot possibly be obtained.(a) {1,01,00}(b) {1,01,10}(c) {01,10,11}