Huffman Encoding : Java Glossary

home page go to the Java Glossary Home go to the Computer Buyer’s Glossary up local find full screen, hide local find menu Google search web for more information on this topic jump to foot of page translate this page with Babelfish punctuation 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z (all) ©1996-2012 2007-08-31 Roedy Green, Canadian Mind Products
Huffman Encoding
Huffman encoding is a simple compression technique. You first calculate the frequency of each of the different letters of the alphabet (including symbols and digits). Then you assign short bit codes to the most frequently used letters, and longer codes to less frequently used letters.

WinZip uses Huffman encoding for files without repeating strings, e.g. files of random numbers expressed in ASCII (American Standard Code for Information Interchange).

Animation to explain Huffman encoding
compression
compression utilities
Wikipedia on Huffman algorithm
WinZip
CMP homejump to top You can get the freshest copy of this page from: or possibly from your local J: drive (Java virtual drive/mindprod.com website mirror)
http://mindprod.com/jgloss/huffman.html J:\mindprod\jgloss\huffman.html
logofeedback Please email your feedback for publication, letters to the editor, errors, omissions, typos, formatting errors, ambiguities, unclear wording, broken/redirected link reports, suggestions to improve this page or comments to Roedy Green : feedback email If you want your message kept confidential, not considered for posting, please explicitly specify that.
mindprod.com IP:[65.110.21.43]
view BlogYour face IP:[38.107.179.211]
You are visitor number 7,380.