Huffman Encoding Table First Try

Become a backend engineer. Its my favorite site

This is also the best way to support me is to support yourself becoming a better backend engineer.

### Got Something For Me to Read or Watch??:

[tmanley]

We need a full network programming tutorial. I'm way too interested in this now.

[SnowDaemon]

First Try on the 3rd go around,
lets go

[FunkyELF]

First try really is a moving target. Back in the day first try meant it compiled and ran correctly but now with IDEs and LSPs he's guaranteed zero compile errors.

[fgf]

Huffman coding is the most efficient way to encode arbitrarily large streams of data by just growing the word size to be arbitrarily large. Other compression algorithms exist because growing the word size has exponential cost in the size of the Huffman tree, so more optimal solutions are possible even for quite large finite data streams if you can avoid the cost of transferring the encoding table itself.

Limiting your encoding scheme to a fixed word size of 7 or 8 bits will hurt potential for optimization down the line.

I could imagine an optimal ASCII encoding involving a pre-shared Huffman tree baked into the compression and decompression tools that’s generated from a histogram of a really large body of input data, like the library of congress, with several byte word sizes.

[Pasyy]

damn this is the first time I'm this early watching a the skill-issue-agen video

[Gennys]

This is not what I need at the moment but I'm going to watch this video anyway because I love you and your content

[airkami]

What is this channel and why does YouTube suggest it?