A Universal Algorithm for Sequential Data Compression

Ziv, J., & Lempel, A. (1977). A Universal Algorithm for Sequential Data Compression. IEEE Transactions on Information Theory, 337-343.

Type

Journal article

Intellectual base

Primary research

Year

1977

Pages

337-343

DOI

10.1109/tit.1977.1055714

DOI registrant

Institute of Electrical and Electronics Engineers

Link

https://doi.org/10.1109/TIT.1977.1055714

Cited from

information_theory

Cited by

2 citations across 2 artifacts.

Each citation links to the sentence it supports in the citing article.

Primes

• Compression
  • Compression appears in computing (file compression: zip, gzip, xz, zstd, lz4

    This sourceThe LZ77 sliding-window dictionary algorithm; universal compression without an explicit probability model, asymptotically optimal for stationary ergodic sources. SUPPORTS marker 173 (zip/gzip/xz/zstd/lz4 lineage). DOI verified. NOTE: published author order is 'Ziv, J., & Lempel, A.' — the prime lists 'Lempel, A., & Ziv, J.', which inverts the byline (the algorithm is named LZ77 from alphabetical author order, but the paper byline is Ziv-then-Lempel). See flag.

    Supported in partVerified against the publisher's abstract

    The abstract establishes a universal algorithm for sequential data compression but never names zip, gzip, xz, zstd or lz4, so it grounds the LZ77 ancestor, not the computing-format list the claim cites it for.

    “A universal algorithm for sequential data compression is presented. Its performance is investigated with respect to a nonprobabilistic model of constrained sources.”

    Read by an automated reader; not a human review. How support was checked

Domain-specific

• Lempel–Ziv Adaptive Dictionary Coding
  • “Dictionary” here includes both an explicit phrase table and an implicit history of decoded output; a separate growing phrase dictionary need not be transmitted.

    This sourceOriginal article copy consulted at https://pzs.dstu.dp.ua/ComputerGraphics/ic/bibl/ziv_lempel_1977.pdf.

Verification

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Read against the text for 1 of 2 citations: 1 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:51a029fd2a52 · see in the full table