This is a long overdue continuation of a series I stared a couple years ago. Last time I wrote about huffman codes, and eventually was going to write about prefix trees. Does this research really provide anything useful for the world? Maybe not. It is more of a curiosity. As a computer scientist, I have long found it fascinating how my predecessors of one or […]
Compressing a Word List on 1980’s Hardware Continue Reading »
This is the third post in a series. Part 1: Studying an Old E-Reader for Fun Part 2: Studying an Old E-Reader for Fun : Text Compression 1 Part 3: Studying an Old E-Reader : Compressing a Dictionary with Huffman Codes Part 4: Studying an Old E-Reader : Compressing a Dictionary with a Prefix Tree (coming soon) Quick Recap Last week I established a few
Studying an Old E-Reader : Compressing a Dictionary with Huffman Codes Continue Reading »
This is the second post in a series. Part 1: Studying an Old E-Reader for Fun Part 2: Studying an Old E-Reader for Fun : Text Compression 1 Part 3: Studying an Old E-Reader : Compressing a Dictionary with Huffman Codes Part 4: Studying an Old E-Reader : Compressing a Dictionary with a Prefix Tree (coming soon) Programming Tradeoffs A lot of what we do
Studying an Old E-Reader for Fun : Text Compression 1 Continue Reading »
