Universal lossless compression via multilevel pattern matching
From MaRDI portal
Publication:4501756
DOI10.1109/18.850665zbMath1003.94017WikidataQ29041570 ScholiaQ29041570MaRDI QIDQ4501756
Pamela C. Cosman, John Cronan Kieffer, Enhui Yang, Gregory J. Nelson
Publication date: 7 September 2000
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://escholarship.org/uc/item/39k54514
entropy; redundancy; arithmetic coding; universal codes; multilevel pattern matching code; universal lossless data compression code
68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)
94A29: Source coding
Related Items
Random Access to Grammar-Compressed Strings and Trees, Computing Longest Common Substring and All Palindromes from Compressed Strings, A FULLY COMPRESSED PATTERN MATCHING ALGORITHM FOR SIMPLE COLLAGE SYSTEMS, One-dimensional staged self-assembly, Efficient algorithms to compute compressed longest common substrings and compressed palindromes, XML compression techniques: A survey and comparison, Linear-time text compression by longest-first substitution, Collage system: A unifying framework for compressed pattern matching., Constructing small tree grammars and small circuits for formulas, A fully linear-time approximation algorithm for grammar-based compression, FINDING CHARACTERISTIC SUBSTRINGS FROM COMPRESSED TEXTS
