On the average redundancy rate of the Lempel-Ziv code with the \(k\)-error protocol
From MaRDI portal
Publication:5944437
DOI10.1016/S0020-0255(01)00101-3zbMath1029.68548OpenAlexW1970343914MaRDI QIDQ5944437
Wojciech Szpankowski, Yuriy A. Reznik
Publication date: 10 October 2001
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0255(01)00101-3
data compressionasymptotic analysisaverage redundancy ratedigital search treesLempel-Ziv parsing scheme
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees
- Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression
- Digital Search Trees Revisited
- Generalized Digital Trees and Their Difference—Differential Equations
- Compression of individual sequences via variable-rate coding
- On the average redundancy rate of the Lempel-Ziv code
- Redundancy of the Lempel-Ziv incremental parsing rule
- Error-Resilient Optimal Data Compression
- Average profile of the Lempel-Ziv parsing scheme for a Markovian source
This page was built for publication: On the average redundancy rate of the Lempel-Ziv code with the \(k\)-error protocol