Universal Multiterminal Source Coding Algorithms With Asymptotically Zero Feedback: Fixed Database Case

DOI10.1109/TIT.2008.2006449MaRDI QIDQ3604895zbMATH OpenOpenAlexFDO

Authors

Publication date 24 February 2009

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

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

zbMATH Keywords

\(phi\)-mixingdatabasedistributed source codingentropyfeedbackstring matchinguniversal data compression

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• On fixed-database universal data compression with limited memory
• An Algorithm for Universal Lossless Compression With Side Information
• Universal Algorithms for Channel Decoding of Uncompressed Sources
• Multiterminal source encoding with one distortion criterion
• An algorithm for source coding subject to a fidelity criterion, based on string matching

This page was built for publication: Universal Multiterminal Source Coding Algorithms With Asymptotically Zero Feedback: Fixed Database Case

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