Showing papers on "Entropy encoding published in 1969"
01 Jan 1969
TL;DR: A method is developed of optimizing a code for data compression by run length encoding and the performance of this code (13.20 compression factor) is compared with the theoretically attainable compression based on the information content of the probability distribution of run lengths.
Abstract: A method is developed of optimizing a code for data compression by run length encoding. The performance of this code (13.20 compression factor) is then compared with the theoretically attainable compression based on the information content of the probability distribution of run lengths.
36 citations
TL;DR: The “principle of conservation of entropy” and the “noiseless coding theorem” are proved under very general conditions.
Abstract: The aim of this paper is to provide a mathematically rigorous and sufficiently general treatment of the basic information-theoretic problems concerning sources with symbols of different costs and noiseless coding in a general sense. The main new concepts defined in this paper are the entropy rate (entropy per unit cost) of a source with respect to a stochastic cost scale and the encoding (in particular decodable encoding) of a source in a general sense. On the basis of these concepts, we prove some general theorems on the relation of entropy rates with respect to different cost scales and on the effect of encoding to the entropy rate. In particular, the “principle of conservation of entropy” and the “noiseless coding theorem” are proved under very general conditions.
9 citations