The redundancy and distribution of the phrase lengths of the fixed-database Lempel-Ziv algorithm

From MaRDI portal

Revision as of 00:04, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4371887

Jump to:navigation, search

DOI10.1109/18.623144zbMath1053.94543OpenAlexW2105595880MaRDI QIDQ4371887

Abraham J. Wyner

Publication date: 1997

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/886a4d1dce2d67ff49ad2e307dedaa648e7b0217

Mathematics Subject Classification ID

Special processes (60K99) Measures of information, entropy (94A17) Information theory (general) (94A15) Information storage and retrieval of data (68P20) Source coding (94A29)

Related Items (4)

Lempel-Ziv-like parsing in small space ⋮ Redundancy estimates for the Lempel–Ziv algorithm of data compression ⋮ More on recurrence and waiting times ⋮ Data compression and learning in time sequences analysis

This page was built for publication: The redundancy and distribution of the phrase lengths of the fixed-database Lempel-Ziv algorithm

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4371887&oldid=18371398"