DocumentCode
1543336
Title
On the cost of worst case coding length constraints
Author
Baron, Dror ; Singer, Andrew C.
Author_Institution
Coordinated Sci. Lab., Illinois Univ., Urbana, IL, USA
Volume
47
Issue
7
fYear
2001
fDate
11/1/2001 12:00:00 AM
Firstpage
3088
Lastpage
3090
Abstract
We investigate the redundancy that arises from adding a worst case length constraint to uniquely decodable fixed-to-variable codes over achievable Huffman (1952) codes. This is in contrast to the traditional metric of the redundancy over the entropy. We show that the cost for adding constraints on the worst case coding length is small, and that the resulting bound is related to the Fibonacci numbers
Keywords
Huffman codes; decoding; entropy; source coding; Fibonacci numbers; Huffman codes; entropy; lossless source coding; redundancy; uniquely decodable fixed-to-variable codes; worst case coding expansion; worst case coding length constraints; Computer aided software engineering; Costs; Decoding; Entropy; Huffman coding; Random variables; Source coding;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.959291
Filename
959291
Link To Document