DocumentCode
3054132
Title
Entropy and data compression performances
Author
Lanza, Piergiorgio
Author_Institution
Alenia Aerospazio Divisione Spazio, Torino, Italy
fYear
1998
fDate
30 Mar-1 Apr 1998
Firstpage
558
Abstract
Summary form only given. We describe a simple algorithm, based on the original Shannon formulation, to determine the entropy orders of an input file. Furthermore we analyse some properties relative to the entropy orders evaluated. Finally a general preprocessing method is sketched. The goal of this module is to reduce the running time and waste of computational resources relative to the data compression. The is to attempt to answer a more general question. Is it possible to predict the data compression performance of any compressor only on the basis of the complete knowledge of the data entropy?
Keywords
data compression; entropy; Huffman coding; Shannon formulation; algorithm; compression ratio; data compression performance; data entropy; entropy orders; first order arithmetic coding; general preprocessing method; input file; running time reduction; Arithmetic; Books; Data compression; Entropy; Neural networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Compression Conference, 1998. DCC '98. Proceedings
Conference_Location
Snowbird, UT
ISSN
1068-0314
Print_ISBN
0-8186-8406-2
Type
conf
DOI
10.1109/DCC.1998.672298
Filename
672298
Link To Document