A statistical compression method that converts characters into variable length bit strings. Most-frequently occurring characters are converted to shortest bit strings; least frequent, the longest. Compression takes two passes. The first pass analyzes a block of data and creates a tree model based on its contents. The second pass compresses the data via the model. Decompression decodes the variable length strings via the tree. See LZW.
Search For Huffman coding On ChannelWeb
Find the latest news and information on Huffman coding from across the Channelweb Network of IT Web sites.