LearnITWithMrC

Huffman Coding

Lesson Video

53

Lesson Tasks

Watch the Lesson video
Make notes if needed.
Open your Learning Journal
Complete Task 1 in your Learning Journal
Complete the learning activities
Make sure you complete the book tasks in your Unit Booklet
Complete End of Task Assessment
Update your learning objectives

What do I need to Learn?

0 results forGuest

I need to learn how to explain how data can be compressed using Huffman coding.

I need to learn how to interpret Huffman trees.

I need to learn how to calculate the number of bits required to store a piece of data compressed using Huffman coding.

I need to learn how to calculate the number of bits required to store a piece of uncompressed data in ASCII.

Key Terms

Huffman coding lossless compression frequency nodes Huffman tree encode

Task 1 - Getting organised Click to see more

Task: Learning Journal

Open your Learning Journal by clicking on the image below

Good notes will help you organise and process data and information

Task 2 - Huffman Coding Click to see more

Huffman Coding

Huffman encoding is a lossless compression technique that is most commonly used to compress text documents. This means that the file can be reduced in size without losing any of the information required to create the original contents. It works particularly well when characters appear multiple times within the file that is going to be compressed.

Without compression, each character in a text file would have an equal number of bits. If you were using 8-bit ASCII, then each character would take up 1 byte of space. For example, if you had a piece of text that was 180 characters, the size of the file’s data would be 180 bytes or 1,440 bits (180, times, 8,180×8).

Click here to continue reading