Quasi-distinct parsing and optimal compression methods
From MaRDI portal
(Redirected from Publication:417983)
Recommendations
Cites work
- scientific article; zbMATH DE number 107482 (Why is no real title available?)
- A universal algorithm for sequential data compression
- An analysis of the Burrows-Wheeler transform
- Coding theorems for individual sequences
- Compression of individual sequences via variable-rate coding
- Grammar-based codes: a new class of universal lossless source codes
- On the Complexity of Finite Sequences
- Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression
- The Universal LZ77 Compression Algorithm Is Essentially Optimal for Individual Finite-Length $N$-Blocks
- The practical efficiency of convolutions in pattern matching algorithms
Cited in
(3)
This page was built for publication: Quasi-distinct parsing and optimal compression methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q417983)