On the distribution function of the complexity of finite sequences
From MaRDI portal
Publication:1006739
DOI10.1016/j.ins.2008.12.019zbMath1171.68015arXivmath/0009084OpenAlexW2003690839MaRDI QIDQ1006739
Publication date: 25 March 2009
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0009084
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cites Work
- Unnamed Item
- Unnamed Item
- Parallel Lempel Ziv coding
- Sequence Complexity as a Test for Cryptographic Systems
- The Lempel–Ziv Complexity of Fixed Points of Morphisms
- Variance estimators for the Lempel-Ziv entropy rate estimator
- Bounds on expansion in LZ'77-like coding
- Causal coding of stationary sources and individual sequences with high resolution
- The Lempel-Ziv algorithm and message complexity
- On the Complexity of Finite Sequences
- A universal algorithm for sequential data compression
- Compression of individual sequences via variable-rate coding
- Average Profile of the Generalized Digital Search Tree and the Generalized Lempel--Ziv Algorithm
- Information-Theoretic Limitations of Formal Systems
- Estimating the Entropy Rate of Spike Trains via Lempel-Ziv Complexity
- WORD COMPLEXITY AND REPETITIONS IN WORDS
- Data compression with long repeated strings
- Compression in the presence of shared data
- On the average redundancy rate of the Lempel-Ziv code with the \(k\)-error protocol
This page was built for publication: On the distribution function of the complexity of finite sequences
