The redundancy and distribution of the phrase lengths of the fixed-database Lempel-Ziv algorithm
From MaRDI portal
Publication:4371887
DOI10.1109/18.623144zbMath1053.94543MaRDI QIDQ4371887
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
60K99: Special processes
94A17: Measures of information, entropy
94A15: Information theory (general)
68P20: Information storage and retrieval of data
94A29: Source coding
Related Items
Redundancy estimates for the Lempel–Ziv algorithm of data compression, More on recurrence and waiting times, Data compression and learning in time sequences analysis, Lempel-Ziv-like parsing in small space