Quasi-distinct parsing and optimal compression methods

DOI10.1016/j.tcs.2011.11.022zbMath1242.68106OpenAlexW2046546073MaRDI QIDQ417983

Yuri Roshko, Amihood Amir, Avivit Levy, Yonatan Aumann

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

zbMATH Keywords

arithmetic progressionsparsingoptimal compression

Mathematics Subject Classification ID

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)

Related Items

On parsing optimality for dictionary-based text compression -- the \texttt{Zip} case

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
• The Universal LZ77 Compression Algorithm Is Essentially Optimal for Individual Finite-Length $N$-Blocks

This page was built for publication: Quasi-distinct parsing and optimal compression methods