Compression of individual sequences via variable-rate coding
From MaRDI portal
Publication:4174617
DOI10.1109/TIT.1978.1055934zbMath0392.94004OpenAlexW2122962290WikidataQ29038778 ScholiaQ29038778MaRDI QIDQ4174617
Publication date: 1978
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1978.1055934
AlgorithmCompression of Individual SequencesConstructive Coding TheoremData- CompressionFinitestate Information-Lossless EncodersVariable-Rate Coding
Related Items (only showing first 100 items - show all)
Pass-efficient methods for compression of high-dimensional turbulent flow data ⋮ Entropy estimation of symbol sequences ⋮ Computing q-Gram Non-overlapping Frequencies on SLP Compressed Texts ⋮ A Heuristic For Computing Repeats With A Factor Oracle: Application To Biological Sequences ⋮ Metric properties about Banach averages and super simply normal numbers ⋮ Factorizing strings into repetitions ⋮ Fast gapped variants for Lempel-Ziv-Welch compression ⋮ Diverse Palindromic Factorization Is NP-complete ⋮ Contrasting stochasticity with chaos in a permutation Lempel-Ziv complexity -- Shannon entropy plane ⋮ Unnamed Item ⋮ FINDING CHARACTERISTIC SUBSTRINGS FROM COMPRESSED TEXTS ⋮ On the approximation ratio of LZ-end to LZ77 ⋮ Dimensions of Copeland-Erdös sequences ⋮ Self-indexed Text Compression Using Straight-Line Programs ⋮ Phase transitions in tumor growth. VI: Epithelial-mesenchymal transition ⋮ A parametrized family of Tversky metrics connecting the Jaccard distance to an analogue of the normalized information distance ⋮ Quantum logical depth and shallowness of streaming data by one-way quantum finite-state transducers (preliminary report) ⋮ Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism ⋮ Estimating the Entropy Rate of Spike Trains via Lempel-Ziv Complexity ⋮ Succinct 2D dictionary matching ⋮ Sublinear algorithms for approximating string compressibility ⋮ R\'enyi entropy and pattern matching for run-length encoded sequences ⋮ Fingerprints in compressed strings ⋮ Grammar-compressed indexes with logarithmic search time ⋮ Automatic Kolmogorov complexity, normality, and finite-state dimension revisited ⋮ Unnamed Item ⋮ Phase Transition in Elementary Cellular Automata with Memory ⋮ A search for good pseudo-random number generators: survey and empirical studies ⋮ Lempel Ziv Computation in Small Space (LZ-CISS) ⋮ LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding ⋮ Optimal in-place suffix sorting ⋮ Constructing Words with High Distinct Square Densities ⋮ Engineering Practical Lempel-Ziv Tries ⋮ Color image steganography scheme using gray invariant in AMBTC compression domain ⋮ Unified compression-based acceleration of edit-distance computation ⋮ Recurrence times, waiting times and universal entropy production estimators ⋮ Sensitivity of string compressors and repetitiveness measures ⋮ Stronger Lempel-Ziv based compressed text indexing ⋮ Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases ⋮ Dimension is compression ⋮ Bounded Pushdown Dimension vs Lempel Ziv Information Density ⋮ Note on the greedy parsing optimality for dictionary-based text compression ⋮ Variance estimators for the Lempel-Ziv entropy rate estimator ⋮ A combinatorial view on string attractors ⋮ The Maximum Equality-Free String Factorization Problem: Gaps vs. No Gaps ⋮ Sequence complexity and work extraction ⋮ LZ78 Compression in Low Main Memory Space ⋮ On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation ⋮ Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries ⋮ Diverse Palindromic Factorization is NP-Complete ⋮ Burrows-Wheeler compression: Principles and reflections ⋮ Compressing table data with column dependency ⋮ Towards Approximate Matching in Compressed Strings: Local Subsequence Recognition ⋮ Self-indexing Based on LZ77 ⋮ Faster Subsequence and Don’t-Care Pattern Matching on Compressed Texts ⋮ Estimating Entropy Rates with Bayesian Confidence Intervals ⋮ Colored operads, series on colored operads, and combinatorial generating systems ⋮ Complexity and meaning in nonlinear dynamical systems ⋮ Selection of a metric for the nearest neighbor entropy estimators ⋮ Phylogenetic analysis of DNA sequences based on the generalized pseudo-amino acid composition ⋮ A fast and efficient nearly-optimal adaptive Fano coding scheme ⋮ Convergence properties of functional estimates for discrete distributions ⋮ Size and path length of Patricia tries: Dynamical sources context ⋮ Distance measures for biological sequences: some recent approaches ⋮ Redundancy estimates for the Lempel–Ziv algorithm of data compression ⋮ Lempel-Ziv compressed structures for document retrieval ⋮ Opportunistic data structures for range queries ⋮ Polylog Space Compression Is Incomparable with Lempel-Ziv and Pushdown Compression ⋮ Unnamed Item ⋮ The permutation entropy rate equals the metric entropy rate for ergodic information sources and ergodic dynamical systems ⋮ The Vcodex Platform for Data Compression ⋮ On the complexity of the smallest grammar problem over fixed alphabets ⋮ Unnamed Item ⋮ Direct merging of delta encoded files ⋮ Computing absolutely normal numbers in nearly linear time ⋮ Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing ⋮ Quasi-distinct Parsing and Optimal Compression Methods ⋮ Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure ⋮ On the Value of Multiple Read/Write Streams for Data Compression ⋮ CONVERGENCE OF C0 COMPLEXITY ⋮ On the size of overlapping Lempel-Ziv and Lyndon factorizations ⋮ Complexity-based permutation entropies: from deterministic time series to white noise ⋮ General Document Retrieval in Compact Space ⋮ Error Analysis of ZFP Compression for Floating-Point Data ⋮ Finger search in grammar-compressed strings ⋮ Fast Exponentiation Using Data Compression ⋮ A Space-Optimal Grammar Compression. ⋮ NONLINEAR SIGNAL CLASSIFICATION ⋮ Random Access to High-Order Entropy Compressed Text ⋮ A fully linear-time approximation algorithm for grammar-based compression ⋮ BOUNDED SIZE DICTIONARY COMPRESSION: RELAXING THE LRU DELETION HEURISTIC ⋮ A non-parametric symbolic approximate representation for long time series ⋮ Sampling automata and programs ⋮ Approximate pattern matching in LZ77-compressed texts ⋮ Compressed automata for dictionary matching ⋮ Constructing LZ78 tries and position heaps in linear time for large alphabets ⋮ Bridging Lossy and Lossless Compression by Motif Pattern Discovery ⋮ Fast distance multiplication of unit-Monge matrices ⋮ Linked dynamic tries with applications to LZ-compression in sublinear time and space ⋮ Universal coding for memoryless sources with countably infinite alphabets
This page was built for publication: Compression of individual sequences via variable-rate coding
