Can we optimize data by fixing the encoding length instead of the message?

Information Theory, Lecture 8: Tunstall’s code - Oxford Mathematics 3rd Year Student Lecture · 53:03 · Video: Oxford Mathematics · Watch at the source

In short: In this lecture from Sam Cohen's third-year Information Theory course at Oxford, we explore Tunstall’s algorithm. Discover how to build optimal codes by varying input length while maintaining a fixed encoding length.

While standard variable-length encodings focus on compressing messages of different lengths, Tunstall’s algorithm approaches the problem from the opposite direction. It considers a system where the encoding length remains fixed, but the length of the input messages varies.

This mathematical approach provides an optimal method for constructing such codes, offering a unique perspective on the fundamental mechanics of information theory.

Opens the Intellect+ feed with this card first. Swipe up for the next one.

Sources

To cite this card, link to https://intellectplus.co.uk/app/science-information-theory-lecture-8-tunstall-s-code-oxford-mathemat.

How we source, check and correct cards: Editorial standards.

General information, not professional advice. Spotted an error? Flag the card or see corrections and complaints.

Intellect Plus is a visual educational discovery platform for exploring fascinating facts and ideas. Brain Food, Not Brain Rot. What is Intellect Plus?

Related

Finding something worth knowing…