Pages that link to "Item:Q4174617"
From MaRDI portal
The following pages link to Compression of individual sequences via variable-rate coding (Q4174617):
Displayed 50 items.
- Finite state incompressible infinite sequences (Q259039) (← links)
- Information entropy as a basic building block of complexity theory (Q280525) (← links)
- Normality and finite-state dimension of Liouville numbers (Q285510) (← links)
- A novel block-based scheme for arithmetic coding (Q296285) (← links)
- Straight-line programs: a practical test (extended abstract) (Q376125) (← links)
- On compressing and indexing repetitive sequences (Q390894) (← links)
- Similarity in languages and programs (Q391201) (← links)
- On parsing optimality for dictionary-based text compression -- the \texttt{Zip} case (Q396650) (← links)
- Characterization of chaotic multiscale features on the time series of melt index in industrial propylene polymerization system (Q398468) (← links)
- Compact q-gram profiling of compressed strings (Q401308) (← links)
- Quasi-distinct parsing and optimal compression methods (Q417983) (← links)
- Monge properties of sequence alignment (Q418004) (← links)
- A linearly computable measure of string complexity (Q441859) (← links)
- Impugning randomness, convincingly (Q454396) (← links)
- Textual data compression in computational biology: algorithmic techniques (Q465689) (← links)
- Nearest-neighbor entropy estimators with weak metrics (Q476332) (← links)
- A sensor-based framework for kinetic data compression (Q482331) (← links)
- The greedy approach to dictionary-based static text compression on a distributed system (Q491153) (← links)
- Practical fixed length Lempel-Ziv coding (Q496549) (← links)
- Faster Lyndon factorization algorithms for SLP and LZ78 compressed text (Q507399) (← links)
- Compressed subsequence matching and packed tree coloring (Q513266) (← links)
- Polylog space compression, pushdown compression, and Lempel-Ziv are incomparable (Q538463) (← links)
- Balancing and clustering of words in the Burrows-Wheeler transform (Q544888) (← links)
- Space-efficient construction of Lempel-Ziv compressed text indexes (Q549672) (← links)
- Scalability and communication in parallel low-complexity lossless compression (Q626896) (← links)
- A fast dynamic compression scheme for natural language texts (Q630711) (← links)
- Algorithmic folding complexity (Q659709) (← links)
- On-line versus off-line computation in dynamic text compression (Q671415) (← links)
- Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees (Q672989) (← links)
- The power of amnesia: Learning probabilistic automata with variable memory length (Q676238) (← links)
- Is Huffmann coding dead? (Q685866) (← links)
- Finite state complexity (Q719308) (← links)
- Lempel-Ziv-78 compressed string dictionaries (Q724216) (← links)
- Lempel-Ziv factorization powered by space efficient suffix trees (Q724218) (← links)
- Sensor networks: from dependence analysis via matroid bases to online synthesis (Q742408) (← links)
- Expanding the algorithmic information theory frame for applications to Earth observation (Q742657) (← links)
- Eulerian entropy and non-repetitive subword complexity (Q764367) (← links)
- A faster algorithm for the computation of string convolutions using LZ78 parsing (Q765493) (← links)
- On normality in shifts of finite type (Q778523) (← links)
- Text compression methods (Q805263) (← links)
- Entropy rates and finite-state dimension (Q817815) (← links)
- A normal sequence compressed by PPM* but not by Lempel-Ziv 78 (Q831838) (← links)
- Faster subsequence recognition in compressed strings (Q843615) (← links)
- Using data compressors to construct order tests for homogeneity and component independence (Q845628) (← links)
- Solving a \(k\)-node minimum label spanning arborescence problem to compress fingerprint templates (Q846172) (← links)
- A universal online caching algorithm based on pattern matching (Q848635) (← links)
- Parallel comparison of run-length-encoded strings on a linear systolic array (Q867612) (← links)
- A simple storage scheme for strings achieving entropy bounds (Q870846) (← links)
- Replacing suffix trees with enhanced suffix arrays (Q876707) (← links)
- Indexing text using the Ziv--Lempel trie (Q876708) (← links)