Quasi-distinct Parsing and Optimal Compression Methods
From MaRDI portal
Recommendations
- Quasi-distinct parsing and optimal compression methods
- On optimal parsing for LZ78-like compressors
- scientific article; zbMATH DE number 1305530
- scientific article; zbMATH DE number 2119662
- Note on the greedy parsing optimality for dictionary-based text compression
- Approximation of Grammar-Based Compression via Recompression
- Approximation of grammar-based compression via recompression
- scientific article; zbMATH DE number 1136072
- A fully linear-time approximation algorithm for grammar-based compression
Cites work
- 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
- scientific article; zbMATH DE number 107482 (Why is no real title available?)
- On the Complexity of Finite Sequences
- Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression
- The practical efficiency of convolutions in pattern matching algorithms
Cited in
(2)
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 Q3637102)