5 ms·
> The first step involves yet another clever strategy for identifying repetition and thereby compressing message size, but the second step is to take the result
by denvaar 3y ago
> The first step involves yet another clever strategy for identifying repetition and thereby compressing message size, but the second step is to take the resulting compressed message and run it through the Huffman process.
I wonder if this "first step" is Burrows-Wheeler Transform?
Side note: In Silicon Valley (the show), I'm pretty sure that Richard has a picture of David Huffman by his bedside.
- Scaevolus 3y agoNo, BWT is largely unused in modern compression codecs. Lempel-Ziv is the basis for almost all modern general purpose compression, and works more like having a hash table mapping 3 or 4 byte fragments to their positions, and walking through the input byte by byte checking the hash table for matches and inserting the latest fragments&positions into the hash table. BWT has nearly identical speed compressing and decompressing, but searching for matches to compress is much slower than simply copying data according to instructions to decompress.
- pseudotrash 3y agoI came here to find Silicon Valley references and wasn't disappointed.
- devsegal 3y agoBoth of us have been satisfied
- hinkley 3y agoat the same time?
- ThrowawayTestr 3y agoI don't like that show because whenever I watch it I start imagining a world with inside-out compression and I get sad we'll never have it.
- LoganDark 3y agoWhat is inside-out compression?
- CharlesW 3y agoI believe the parent meant "middle out". (Very NSFW: https://www.youtube.com/watch?v=Ex1JuIN0eaA https://www.youtube.com/watch?v=Ex1JuIN0eaA)
- LoganDark 3y ago> Very NSFW I didn't believe you until about a minute in. LOL
- ThrowawayTestr 3y agoHow did I make that mistake, I'm so ashamed.
- highwaylights 3y agoI mean, sure it’s NSFW, but just take a look at that Weissman Score!!