Results on the Redundancy of Universal Compression for Finite-Length Sequences
Recently, there has been a tremendous increase in the amount of data being stored in the storage systems. The redundancy present in the data may be leveraged to significantly reduce the cost of data maintenance as well as data transmission. In many cases, however, the data consists of several small files that need to be compressed and retrieved individually, i.e., a finite-length compression problem. Moreover, different data sets may be of various natures, hence little a priori assumptions may be made regarding the probability distribution of the data, i.e., universal compression. This necessitates the study of the universal compression of finite-length sequences.