The macro model for data compression (extended abstract)

DOI10.1145/800133.804329MaRDI QIDQ5402538zbMATH OpenOpenAlexFDO

Authors James A. Storer, Thomas G. Szymanski

Publication date 14 March 2014

Published in Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/800133.804329

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Database theory (68P15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Toward an abstract theory of data compression
• Data compression with long repeated strings
• A universal algorithm for sequential data compression
• A note on the DMC data compression scheme
• scientific article; zbMATH DE number 4045113

Cited in

(22)

• Random access in persistent strings and segment selection
• MICAI 2004: Advances in Artificial Intelligence
• scientific article; zbMATH DE number 1844683 (Why is no real title available?)
• Optimal encoding of non-stationary sources
• A theory of incremental compression
• Forty Years of Text Indexing
• Approximability of minimum AND-circuits
• A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem
• A fully linear-time approximation algorithm for grammar-based compression
• A note on the DMC data compression scheme
• Data compression with long repeated strings
• On finding minimal length superstrings
• Compressibility of Finite Languages by Grammars
• Approximation of smallest linear tree grammar
• Approximation of grammar-based compression via recompression
• scientific article; zbMATH DE number 3910293 (Why is no real title available?)
• A \textit{really} simple approximation of smallest grammar
• scientific article; zbMATH DE number 7765406 (Why is no real title available?)
• Toward an abstract theory of data compression
• Generalized Context Modeling With Multi-Directional Structuring and MDL-Based Model Selection for Heterogeneous Data Compression
• On the compressibility of finite languages and formal proofs
• Dynamic relative compression, dynamic partial sums, and substring concatenation

This page was built for publication: The macro model for data compression (extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5402538)