A Universal Algorithm for Sequential Data Compression
Ziv J., Lempel A.
IEEE Trans. Inform. Theory. – 1977. – Vol 23, N 3. – P. 337–343.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.
Категории:
Година:
1977
Език:
english
Страници:
7
Файл:
PDF, 481 KB
IPFS:
,
english, 1977
Amazon 
Barnes & Noble 
Bookshop.org
Искате ли да добавите книжарница? Свържете се с нас на support@z-lib.fm
Конвертиране на файлове
Още резултати от търсенето
Други предимства ![Lehmer D. N. — [Article] Arithmetical Theory of Certain Hurwitzian Continued Fractions](https://s3proxy.cdn-zlib.se/covers200/collections/genesis/de4f69835a7cfd32daa07a8dd709824eb609947f351c0e4b03300c4f1e7ac99f.jpg)
