Compression of individual sequences via variable-rate coding
From MaRDI portal
Publication:4174617
DOI10.1109/TIT.1978.1055934zbMath0392.94004WikidataQ29038778 ScholiaQ29038778MaRDI QIDQ4174617
Publication date: 1978
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Algorithm; Compression of Individual Sequences; Constructive Coding Theorem; Data- Compression; Finitestate Information-Lossless Encoders; Variable-Rate Coding
Related Items
Complexity and meaning in nonlinear dynamical systems, Entropy estimation of symbol sequences, NONLINEAR SIGNAL CLASSIFICATION, A Heuristic For Computing Repeats With A Factor Oracle: Application To Biological Sequences, Estimating the Entropy Rate of Spike Trains via Lempel-Ziv Complexity, Redundancy estimates for the Lempel–Ziv algorithm of data compression, Computing Longest Common Substring and All Palindromes from Compressed Strings, Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space, Universal Data Compression Algorithm Based on Approximate String Matching, WORD COMPLEXITY AND REPETITIONS IN WORDS, A FULLY COMPRESSED PATTERN MATCHING ALGORITHM FOR SIMPLE COLLAGE SYSTEMS, Words and special factors, Data compression with long repeated strings, Compression in the presence of shared data, Parallelism and dictionary based data compression, On the average redundancy rate of the Lempel-Ziv code with the \(k\)-error protocol, Optimal encoding of non-stationary sources, \(LZ\)-based image compression, Information and dynamical systems: A concrete measurement on sporadic dynamics, On-line versus off-line computation in dynamic text compression, Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees, The power of amnesia: Learning probabilistic automata with variable memory length, Is Huffmann coding dead?, Text compression methods, Entropy rates and finite-state dimension, Parallel comparison of run-length-encoded strings on a linear systolic array, A simple storage scheme for strings achieving entropy bounds, Replacing suffix trees with enhanced suffix arrays, Indexing text using the Ziv--Lempel trie, Adaptive text mining: inferring structure from sequences, Practical and flexible pattern matching over Ziv-Lempel compressed text., Discrete entropy, Similarity analysis of DNA sequences based on the generalized LZ complexity of (0,1)-sequences, An adaptive character wordlength algorithm for data compression, Fast profile matching algorithms - A survey, A novel lossless data compression scheme based on the error correcting Hamming codes, Pushdown dimension, Efficient algorithms to compute compressed longest common substrings and compressed palindromes, On the distribution function of the complexity of finite sequences, Analytical depoissonization and its applications, On updating suffix tree labels, AUTOMATE, a computing package for automata and finite semigroups, Data compression with factor automata, A comparative classification of complexity measures, P-complete problems in data compression, A worst-case analysis of the LZ2 compression algorithm, Truncated suffix trees and their application to data compression., Bounded size dictionary compression: SC\(^{k}\)-completeness and NC algorithms., Universal prediction of random binary sequences in a noisy environment, Parallel Lempel Ziv coding, Strongly consistent nonparametric forecasting and regression for stationary ergodic sequences., Optimal data compression algorithm, Transducers and repetitions, Regular expression searching on compressed text, Approximate string matching on Ziv--Lempel compressed text, Compror: On-line lossless data compression with a factor oracle., Collage system: A unifying framework for compressed pattern matching., Uniform words, Finite-state dimension, Robust universal complete codes for transmission and compression, Fast gapped variants for Lempel-Ziv-Welch compression, Dimensions of Copeland-Erdös sequences, Burrows-Wheeler compression: Principles and reflections, Compressing table data with column dependency, A fast and efficient nearly-optimal adaptive Fano coding scheme, Opportunistic data structures for range queries, The permutation entropy rate equals the metric entropy rate for ergodic information sources and ergodic dynamical systems, A fully linear-time approximation algorithm for grammar-based compression, Convergence properties of functional estimates for discrete distributions, Size and path length of Patricia tries: Dynamical sources context, Estimating Entropy Rates with Bayesian Confidence Intervals, Unnamed Item, BOUNDED SIZE DICTIONARY COMPRESSION: RELAXING THE LRU DELETION HEURISTIC, Bridging Lossy and Lossless Compression by Motif Pattern Discovery, Variance estimators for the Lempel-Ziv entropy rate estimator, Polylog Space Compression Is Incomparable with Lempel-Ziv and Pushdown Compression, The Vcodex Platform for Data Compression, Fast Exponentiation Using Data Compression
