A One-to-One Code and Its Anti-Redundancy

DOI10.1109/TIT.2008.929009MaRDI QIDQ3604957zbMATH OpenOpenAlexFDO

Authors Wojciech Szpankowski

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

Mathematics Subject Classification ID

Source coding (94A29) Bounds on codes (94B65)

Recommendations

• New Bounds on the Expected Length of Optimal One-to-One Codes
• Redundancy of Lossless Data Compression for Known Sources by Analytic Methods
• New bounds on the expected length of one-to-one codes
• Universal redundancy rates do not exist
• A lower bound on the expected length of one-to-one codes

This page was built for publication: A One-to-One Code and Its Anti-Redundancy

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