Universal Lossless Compression of Erased Symbols

DOI10.1109/TIT.2008.2006387MaRDI QIDQ3604867zbMATH OpenOpenAlexFDO

Authors Jiming Yu, Sergio Verdú

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.2006387

zbMATH Keywords

context-tree weightingdiscrete memoryless erasure channelentropyerasure entropyside informationuniversal lossless compression

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Source coding (94A29)

Recommendations

• The Information Lost in Erasures
• An Algorithm for Universal Lossless Compression With Side Information
• Universal Algorithms for Channel Decoding of Uncompressed Sources
• A universal algorithm for sequential data compression
• Fountain codes for lossless data compression

Cited in

(4)

• Fountain codes for lossless data compression
• An Algorithm for Universal Lossless Compression With Side Information
• The Information Lost in Erasures
• Lossless compression algorithm based on context tree

This page was built for publication: Universal Lossless Compression of Erased Symbols

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