Variable-to-fixed length codes for predictable sources Conference Paper

abstract

• Recently, a number of papers have investigated the compression obtained by some well-known lossless data compression algorithms in the limit as the dictionary size approaches infinity. Using a very detailed analysis of the Tunstall code as an example, we demonstrate that asymptotic analyses can fail to provide the performance of an algorithm in the important case of a predictable source with a small to moderate dictionary size.

name of conference

• Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225)

authors

• Savari, Serap

published proceedings

• DCC '98 - DATA COMPRESSION CONFERENCE

author list (cited authors)

• Savari, S. A.

citation count

• 14

complete list of authors

• Savari, SA

publication date

• January 1998

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• Data Compression Conference Proceedings  Journal

keywords

• 40 Engineering
• 4006 Communications Engineering
• 46 Information And Computing Sciences

Digital Object Identifier (DOI)

• 10.1109/DCC.1998.672213

International Standard Book Number (ISBN) 10

• 0-8186-8406-2

start page

• 481

end page

• 490

URL

• http://dx.doi.org/10.1109/dcc.1998.672213