X
By Topic

A universal algorithm for sequential data compression

Sign In

This content is outside your institutional subscription.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)

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.

Published in:

Information Theory, IEEE Transactions on  (Volume:23 ,  Issue: 3 )