Huffman coding
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.
Computer Desktop Encyclopedia THIS DEFINITION IS FOR PERSONAL USE ONLY
All other reproduction is strictly prohibited without permission from the publisher.
Copyright © 1981-2009 by Computer Language Company Inc. All rights reserved.
Share on Facebook