Optimal data compression algorithm
type: Item
instance of: scholarly article
title: Optimal data compression algorithm
zbMATH Open document ID: 0856.68072
DOI: 10.1016/0898-1221(96)00135-6
author: I. Sadeh
publication date: 1997-02-03T00:00:00Z
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 94A29
Mathematics Subject Classification ID: 94A34
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 950611
zbMATH Keywords: source coding scheme
zbMATH Keywords: approximate string matching
zbMATH Keywords: universal lossy coder
MaRDI profile type: Publication
full work available at URL: 0898-1221(96)00135-6
OpenAlex ID: W2048435957
cites work: Pattern matching in a digitized image
cites work: Data structures and algorithms for approximate string matching
cites work: A universal algorithm for sequential data compression
cites work: Compression of individual sequences via variable-rate coding
cites work: A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors
cites work: A Space-Economical Suffix Tree Construction Algorithm
cites work: Suffix Arrays: A New Method for On-Line String Searches
cites work: Coding theorems for individual sequences
cites work: The Lempel-Ziv algorithm and message complexity
cites work: Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm
cites work: Q4731122
cites work: Sliding-block source coding
cites work: Universal almost sure data compression
cites work: Q4835304
cites work: Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression
cites work: Entropy and data compression schemes
cites work: The Erdős-Rényi strong law for pattern matching with a given proportion of mismatches
cites work: The Erdős-Rényi law in distribution, for coin tossing and sequence matching
cites work: A suboptimal lossy data compression based on approximate pattern matching
cites work: Universal Data Compression Algorithm Based on Approximate String Matching
cites work: An algorithm for source coding subject to a fidelity criterion, based on string matching
cites work: Q3935355
cites work: Asymptotical growth of a class of random trees
cites work: On the notion of recurrence in discrete stochastic processes
cites work: Q4004078
cites work: Q3997311
cites work: The Individual Ergodic Theorem of Information Theory
cites work: A sandwich proof of the Shannon-McMillan-Breiman theorem
cites work: Universal codeword sets and representations of the integers
cites work: Linear Algorithm for Data Compression via String Matching
published in: Computers & Mathematics with Applications
Recommended article: Q3727856
Recommended article: Error-Resilient Optimal Data Compression
Recommended article: Data compression
Recommended article: Q4552047
Recommended article: Iterative compression and exact algorithms
Recommended article: Iterative Compression and Exact Algorithms
Recommended article: Q3782752
Recommended article: Optimal Lossless Data Compression: Non-Asymptotics and Asymptotics
Recommended article: MICAI 2004: Advances in Artificial Intelligence
description: scientific article; zbMATH DE number 950611