Quasi-distinct parsing and optimal compression methods
DOI10.1016/J.TCS.2011.11.022zbMATH Open1242.68106OpenAlexW2046546073MaRDI QIDQ417983FDOQ417983
Authors: Amihood Amir, Yonatan Aumann, Avivit Levy, Yuri Roshko
Publication date: 14 May 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.11.022
Recommendations
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Other types of codes (94B60)
Cites Work
- Title not available (Why is that?)
- An analysis of the Burrows—Wheeler transform
- Compression of individual sequences via variable-rate coding
- On the Complexity of Finite Sequences
- A universal algorithm for sequential data compression
- Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression
- Grammar-based codes: a new class of universal lossless source codes
- Coding theorems for individual sequences
- The Universal LZ77 Compression Algorithm Is Essentially Optimal for Individual Finite-Length $N$-Blocks
- The practical efficiency of convolutions in pattern matching algorithms
Cited In (3)
This page was built for publication: Quasi-distinct parsing and optimal compression methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q417983)