LessWrong (Curated & Popular) cover image

"Introduction to abstract entropy" by Alex Altair

LessWrong (Curated & Popular)

00:00

How to Use Different Sized Labels in Prefix Codes

There are infinitely many prefix codes that one could make, each of which could have finitely or infinitely many finite binary strings. This is how you can use different sized labels without having an additional all done symbol. It turns out that for a given probability distribution, p of x over states, the encoding that minimizes average entropy, uses strings that have one bit for every halving that it takes to get to p of x. For example if p of x equals one quarter, that's two halvings so use two bits to encode the state x.

Play episode from 36:36
Transcript

The AI-powered Podcast Player

Save insights by tapping your headphones, chat with episodes, discover the best highlights - and more!
App store bannerPlay store banner
Get the app