A universal algorithm for sequential data compression
J. Ziv, Abraham Lempel · IEEE Transactions on Information Theory · 1977
A universal algorithm for sequential data compression is presented. Its performance is investigated with respect to a nonprobabilistic model of constrained sources. The compression ratio achieved by the proposed universal code uniformly approaches the lower bounds on the compression ratios attainable by block-to-variable codes and variable-to-block codes designed to match a completely specified source.
Cited by 5,424 works. doi:10.1109/tit.1977.1055714
Authors
References
- Information Theory and Reliable Communication
- Information Theory and Reliable Communication.
- A Method for the Construction of Minimum-Redundancy Codes
- On the Complexity of Finite Sequences
- Universal noiseless coding
- Minimum-redundancy coding for the discrete noiseless channel
- Optimal variable length codes (arbitrary symbol cost and equal code word probability)
- On variable-length-to-block coding
- Coding of sources with unknown statistics--I: Probability of encoding error
- Efficient Generation of Optimal Prefix Code