DocumentCode
1190625
Title
A universal variable-to-fixed length source code based on Lawrence´s algorithm
Author
Tjalkens, T.J. ; Willems, F.M.J.
Author_Institution
Fac. of Electr. Eng., Eindhoven Univ. of Technol., Netherlands
Volume
38
Issue
2
fYear
1992
fDate
3/1/1992 12:00:00 AM
Firstpage
247
Lastpage
253
Abstract
It is shown that the modified Lawrence algorithm is universal over the class of binary memoryless sources and that the rate converges asymptotically optimally fast to the source entropy. It is proven that no codes exist that have a better asymptotic performance. The asymptotic bounds show that universal variable-to-fixed-length codes can have a significantly lower redundancy than universal fixed-to-variable-length codes with the same number of codewords.<>
Keywords
codes; encoding; entropy; redundancy; Lawrence algorithm; asymptotic performance; binary memoryless sources; redundancy; source code; source entropy; universal variable-to-fixed-length codes; Decoding; Entropy; Information theory; Source coding; Statistics;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.119684
Filename
119684
Link To Document