Data Compression

Alexei Gilchrist

We examine the problem of optimally encoding a set of symbols in some alphabet to reduce the average length of the code.
❦

1 Codes

To be completed

Introduction to lossless codes: non-singular, unambiguously decodable and prefix codes.

2 Kraft Inequality

The Kraft inequality is an inequality based on the lengths of the codewords. When it holds, we can construct a prefix code with those lengths.

To be completed

3 Optimal Length

To be completed

4 Huffman Codes

To be completed

5 Comments

To be completed

© Copyright 2022 Alexei Gilchrist