Sequential codes, lossless compression of individual sequences, and Kolmogorov complexity
type: Item
instance of: scholarly article
title: Sequential codes, lossless compression of individual sequences, and Kolmogorov complexity
zbMATH Open document ID: 0845.94007
DOI: 10.1109/18.481775
author: Enhui Yang
author: John C. Kieffer
published in: IEEE Transactions on Information Theory
publication date: 1996-07-29T00:00:00Z
Mathematics Subject Classification ID: 94A29
Mathematics Subject Classification ID: 68Q30
zbMATH DE Number: 883623
zbMATH Keywords: Lempel-Ziv algorithm
zbMATH Keywords: sequential codes
zbMATH Keywords: lossless compression
zbMATH Keywords: Kolmogorov complexity
MaRDI profile type: MaRDI publication profile
full work available at URL: https://doi.org/10.1109/18.481775
OpenAlex ID: W2162016992
Recommended article: A sequential algorithm for the universal coding of finite memory sources
Recommended article: A universal algorithm for sequential data compression
Recommended article: Compressibility and Kolmogorov complexity
Recommended article: Efficient Compression of Long Arbitrary Sequences With No Reference at the Encoder
Recommended article: Q4184754
Recommended article: Low-complexity sequential lossless coding for piecewise-stationary memoryless sources
Recommended article: Sequential Decoding - The Computation Problem*
Recommended article: A zero-delay sequential scheme for lossy coding of individual sequences
Recommended article: Kolmogorov complexity version of Slepian-Wolf coding
description: scientific article; zbMATH DE number 883623