https://rietta.com/tags/java/ Recent content in Java on Rietta Cybersecurity Hugo -- gohugo.io en-us 1999-2026 Rietta Inc. All Rights Reserved. https://rietta.com/blog/little-huffman-coding-with-java-tricks/ Mon, 16 May 2005 00:00:00 +0000 https://rietta.com/blog/little-huffman-coding-with-java-tricks/ A Huffman code is a way to utilize a binary tree to construct a minimal-length encoding for messages where certain characters or groups of characters have known frequencies. The tree used for such an operation called a Huffman tree. Huffman codes are the most efficient compression method for random data and are often found as steps in other compression algorithms such as JPEG and Deflate (ZIP). Building such trees is a very common exercise for Computer Science and Math classes so I can skip the details.