An Algorithm for Universal Lossless Compression With Side Information

DOI10.1109/TIT.2006.880020MaRDI QIDQ3547971zbMATH OpenOpenAlexFDO

Authors Haixiao Cai, Sanjeev R. Kulkarni, Sergio Verdú

Publication date 21 December 2008

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

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

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• A universal algorithm for sequential data compression
• Universal Lossless Compression of Erased Symbols
• Universal Data Compression Algorithm Based on Approximate String Matching
• scientific article; zbMATH DE number 2086336
• Simple universal lossy data compression schemes derived from the Lempel-Ziv algorithm

Cited in

(11)

• scientific article; zbMATH DE number 2086336 (Why is no real title available?)
• Superior guarantees for sequential prediction and lossless compression via alphabet decomposition
• Fountain codes for lossless data compression
• On Joint Information Embedding and Lossy Compression
• Universal Lossless Compression of Erased Symbols
• Universal Multiterminal Source Coding Algorithms With Asymptotically Zero Feedback: Fixed Database Case
• On fixed-database universal data compression with limited memory
• Universal lossless data compression with side information by using a conditional MPM grammar transform
• An on-line universal lossy data compression algorithm via continuous codebook refinement. I. Basic results
• Lossless compression algorithm based on context tree
• Estimating the directed information to infer causal relationships in ensemble neural spike train recordings

This page was built for publication: An Algorithm for Universal Lossless Compression With Side Information

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