Generalized Shannon code minimizes the maximal redundancy
M Drmota, W Szpankowski - Latin American Symposium on Theoretical …, 2002 - Springer
Source coding, also known as data compression, is an area of information theory that deals
with the design and performance evaluation of optimal codes for data compression. In 1952
Huffman constructed his optimal code that minimizes the average code length among all
prefix codes for known sources. Actually, Huffman codes minimizes the average redundancy
defined as the difference between the code length and the entropy of the source.
Interestingly enough, no optimal code is known for other popular optimization criterion such …
with the design and performance evaluation of optimal codes for data compression. In 1952
Huffman constructed his optimal code that minimizes the average code length among all
prefix codes for known sources. Actually, Huffman codes minimizes the average redundancy
defined as the difference between the code length and the entropy of the source.
Interestingly enough, no optimal code is known for other popular optimization criterion such …
[CITATION][C] Generalized Shannon Code Minimizes the Maximal Redundancy
W Szpankowski, M Drmota - Proc. LATIN, 2002
Showing the best results for this search. See all results