Huffman coding
Lesson 8 / 8
Lesson video
The video is not available yet.
Lesson slides
not available yet
Lesson details
Lesson outcome
I can describe and use Huffman coding to create a compressed representation of data.
Show transcript
Huffman coding is a lossless compression technique.
Huffman coding assigns shorter bit sequences to more frequent characters and longer sequences to less frequent ones.
A Huffman tree is used to visually represent the encoding scheme to create compressed data.
A Huffman tree sent alongside compressed data adds overhead and can reduce the overall compression efficiency.
Worksheet
not available yet
Quizzes
This quiz is not available yet.
What pupils see
The same lesson as a pupil sees it. You can set any section as work on its own.
- IntroductionPrepare · Not available
- Starter quizActivate · Not available
- Lesson videoLearn · Not available
- Exit quizCheck · Not available
This content is by Cashar and published under an open licence.