Quasi-distinct Parsing and Optimal Compression Methods

DOI10.1007/978-3-642-02441-2_2zbMath1247.68081OpenAlexW1481691646MaRDI QIDQ3637102

Yonatan Aumann, Yuri Roshko, Amihood Amir, Avivit Levy

Publication date: 7 July 2009

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02441-2_2

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Cites Work

• Unnamed Item
• Unnamed Item
• An analysis of the Burrows—Wheeler transform
• Coding theorems for individual sequences
• Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression
• On the Complexity of Finite Sequences
• A universal algorithm for sequential data compression
• Compression of individual sequences via variable-rate coding
• Grammar-based codes: a new class of universal lossless source codes

This page was built for publication: Quasi-distinct Parsing and Optimal Compression Methods