Description: ) Compression using huffman code
-with a number of bits k per code word
-provide huffman table
Huffman coding is optimal for a symbol-by-symbol coding with a known input probability distribution.This technique uses a variable-length code table for encoding a source symbol. The table is derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol .Huffman coding uses a specific method for representing each symbol, resulting in a prefix code that expresses the most common characters using shorter strings of bits than those used for less common source symbols.The Huffman coding is a procedure to generate a binary code tree.
- [JPEGyasuomatlabdaima] - jepg compression Matlab code, using Huff
- [huffman_matlab] - Image compression Huffman encoding and d
- [huffman2] - This is on the inside source coding comp
- [jpg] - jpeg compression matlab source code. By
- [pca_ann] - face recognition using pca and ann wih t
- [Huffman] - Huffman code the whole code, a full desc
- [fano] - Variable-length coding in information th
File list (Check if you may need any files):
source_gen.m
tree.m
tree_code2.m