scientific article
From MaRDI portal
Publication:3782752
zbMath0641.68029MaRDI QIDQ3782752
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
data compressionpattern matchinghashingHuffman codingmaximal common substringsmove-to-front strategyZiv- Lempel algorithm
Data structures (68P05) Information storage and retrieval of data (68P20) Coding theorems (Shannon theory) (94A24)
Related Items (6)
Scalability and communication in parallel low-complexity lossless compression ⋮ Lempel-Ziv data compression on parallel and distributed systems ⋮ Binary image compression via monochromatic pattern substitution: sequential and parallel implementations ⋮ Optimal encoding of non-stationary sources ⋮ Redundancy estimates for the Lempel–Ziv algorithm of data compression ⋮ Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space
This page was built for publication:
