Performance Analysis of Grammar-Based Codes Revisited
From MaRDI portal
Publication:3547013
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
- The Universality of Grammar-Based Codes for Sources With Countably Infinite Alphabets
- Structured grammar-based codes for universal lossless data compression.
- scientific article; zbMATH DE number 2119662
This page was built for publication: Performance Analysis of Grammar-Based Codes Revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547013)