DocumentCode
2985995
Title
Minimum expected length of fixed-to-variable lossless compression of memoryless sources
Author
Szpankowski, Wojciech ; Verdú, Sergio
Author_Institution
Dept. of Comput. Sci., Purdue Univ., West Lafayette, IN, USA
fYear
2009
fDate
June 28 2009-July 3 2009
Firstpage
369
Lastpage
373
Abstract
Conventional wisdom states that the minimum expected length for fixed-to-variable length encoding of an n-block memoryless source with entropy H grows as nH+O(1). However, this performance is obtained under the constraint that the code assigned to the whole n-block is a prefix code. Dropping this unnecessary constraint we show that the minimum expected length grows as nH - 1/2 log n + O(1) unless the source is equiprobable.
Keywords
data compression; decoding; entropy codes; entropy; fixed-to-variable encoding; lossless compression; memoryless source; minimum expected length; prefix code; unique decodability; Binary codes; Compressors; Computer science; Decoding; Encoding; Entropy; Partitioning algorithms; Probability distribution;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2009. ISIT 2009. IEEE International Symposium on
Conference_Location
Seoul
Print_ISBN
978-1-4244-4312-3
Electronic_ISBN
978-1-4244-4313-0
Type
conf
DOI
10.1109/ISIT.2009.5205737
Filename
5205737
Link To Document