Structured grammar-based codes for universal lossless data compression.
From MaRDI portal
Recommendations
- Grammar-based codes: a new class of universal lossless source codes
- Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform-part two: with context models
- Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform. I. Without context models
- Grammar-Based Lossless Universal Refinement Source Coding
- The Universality of Grammar-Based Codes for Sources With Countably Infinite Alphabets
Cited in
(7)- Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform-part two: with context models
- Universal lossless data compression with side information by using a conditional MPM grammar transform
- Grammar-Based Lossless Universal Refinement Source Coding
- Performance Analysis of Grammar-Based Codes Revisited
- Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform. I. Without context models
- A FULLY COMPRESSED PATTERN MATCHING ALGORITHM FOR SIMPLE COLLAGE SYSTEMS
- Grammar-based codes: a new class of universal lossless source codes
This page was built for publication: Structured grammar-based codes for universal lossless data compression.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1421045)