21.2. Variable Length Encoding

Try these first

1. 1.

   What is variable length encoding?

   Hint

   Think about how letters can be represented in a more efficient way.

2. 2.

   Define Huffman Codes.

   Hint

   It’s a solution to reduce the size of encoded messages.

3. 3.

   What does Huffman Coding optimize?

   • Data speed
   • Storage space
   • Data transmission efficiency

   Hint

   Think about the primary purpose of using Huffman Coding.

4. 4.

   True or False: In a prefix code, one code can be a prefix of another code.

   • True
   • False

   Hint

   Remember how ambiguity can arise without this property.

5. 5.

   Construct a Huffman Tree using the letters A (0.4), B (0.3), C (0.2), D (0.1). Then derive the corresponding binary codes.

   Hint

   Start by identifying the two letters with the lowest frequencies.

6. 6.

   Given the probabilities of letters A (0.25), B (0.25), C (0.25), and D (0.25), provide an explanation of how you would use Huffman coding to minimize the length of the encoded message.

   Hint

   Think about how you would choose to combine nodes when frequencies are equal.