Universal lossless compression via multilevel pattern matching
DOI10.1109/18.850665zbMATH Open1003.94017DBLPjournals/tit/KiefferYNC00OpenAlexW2171818384WikidataQ29041570 ScholiaQ29041570MaRDI QIDQ4501756FDOQ4501756
Authors: Enhui Yang, Gregory J. Nelson, John C. Kieffer, Pamela C. Cosman 
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
Recommendations
- scientific article; zbMATH DE number 868046
- A universal algorithm for sequential data compression
- Universal Lossless Compression With Unknown Alphabets—The Average Case
- Context-dependent multilevel pattern matching for lossless image compression
- A suboptimal lossy data compression based on approximate pattern matching
entropyredundancyarithmetic codinguniversal codesmultilevel pattern matching codeuniversal lossless data compression code
Source coding (94A29) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cited In (18)
- Finger search in grammar-compressed strings
- One-dimensional staged self-assembly
- Universal lossless source coding with the Burrows Wheeler transform
- Constructing small tree grammars and small circuits for formulas
- Title not available (Why is that?)
- Finding characteristic substrings from compressed texts
- Efficient algorithms to compute compressed longest common substrings and compressed palindromes
- Collage system: A unifying framework for compressed pattern matching.
- Linear-time text compression by longest-first substitution
- On the complexity of the smallest grammar problem over fixed alphabets
- XML compression techniques: A survey and comparison
- Random access to grammar-compressed strings and trees
- A fully linear-time approximation algorithm for grammar-based compression
- Context-dependent multilevel pattern matching for lossless image compression
- Universal Lossless Compression With Unknown Alphabets—The Average Case
- A FULLY COMPRESSED PATTERN MATCHING ALGORITHM FOR SIMPLE COLLAGE SYSTEMS
- Approximation ratios of \textsf{RePair}, \textsf{LongestMatch} and \textsf{Greedy} on unary strings
- Computing Longest Common Substring and All Palindromes from Compressed Strings
This page was built for publication: Universal lossless compression via multilevel pattern matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501756)
