Uploaded October 2016 | Updated September 2026, 2 hours ago

---

Andrew with UConn HKN presents a video explaining how a Huffman Code can make any piece of code where the probabilities of the bits are known up to 100% efficient.

Still don't get it? Have questions relating to this topic or others? Suggestions for other problems you'd like to see us do? Post in the comments below or email us at "questions.hkn.uconn@gmail.com"