Sequential codes, lossless compression of individual sequences, and Kolmogorov complexity

DOI10.1109/18.481775zbMATH Open0845.94007OpenAlexW2162016992MaRDI QIDQ4879987FDOQ4879987

Authors: Enhui Yang, John C. Kieffer 

Publication date: 29 July 1996

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.481775

Recommendations

• A sequential algorithm for the universal coding of finite memory sources
• A universal algorithm for sequential data compression
• Compressibility and Kolmogorov complexity
• Efficient Compression of Long Arbitrary Sequences With No Reference at the Encoder
• scientific article; zbMATH DE number 3621627
• Low-complexity sequential lossless coding for piecewise-stationary memoryless sources
• Sequential Decoding - The Computation Problem*
• A zero-delay sequential scheme for lossy coding of individual sequences
• Kolmogorov complexity version of Slepian-Wolf coding

zbMATH Keywords

Kolmogorov complexityLempel-Ziv algorithmlossless compressionsequential codes

Mathematics Subject Classification ID

Source coding (94A29) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Cited In (8)

• A universal algorithm for sequential data compression
• Title not available (Why is that?)
• A zero-delay sequential scheme for lossy coding of individual sequences
• Approximation of smallest linear tree grammar
• Approximation of grammar-based compression via recompression
• Title not available (Why is that?)
• On graph entropy measures based on the number of independent sets and matchings
• Title not available (Why is that?)

This page was built for publication: Sequential codes, lossless compression of individual sequences, and Kolmogorov complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4879987)