作者:
J Ziv，A Lempel
关键词:
Sequential coding ； Source coding ； Books ； Compression algorithms ； Data compression ； Data processing ； Displays ； Information theory ； Jacobian matrices ； Telephony
摘要:
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.
在线下载