On fixed-database universal data compression with limited memory

DOI10.1109/18.641559MaRDI QIDQ4392396zbMATH OpenOpenAlexFDO

Authors Yehuda Hershkovits, Jacob Ziv

Publication date 4 February 1999

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

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

zbMATH Keywords

lossless data compressionsource coding

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Parallel algorithms in computer science (68W10) Source coding (94A29)

Recommendations

• On sliding-window universal data compression with limited memory
• Inequalities and algorithms for universal data compression
• A universal algorithm for sequential data compression
• An Algorithm for Universal Lossless Compression With Side Information
• Universal almost sure data compression

Cited in

(5)

• On the Version Space Compression Set Size and Its Applications
• Universal Multiterminal Source Coding Algorithms With Asymptotically Zero Feedback: Fixed Database Case
• scientific article; zbMATH DE number 169463 (Why is no real title available?)
• On the amount of statistical side information required for lossy data compression
• On sliding-window universal data compression with limited memory

This page was built for publication: On fixed-database universal data compression with limited memory

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