New Bounds on the Expected Length of Optimal One-to-One Codes

DOI10.1109/TIT.2007.894628MaRDI QIDQ3548811zbMATH OpenOpenAlexFDO

Authors Jay Cheng, Tien-Ke Huang, Claudio Weidmann

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

Mathematics Subject Classification ID

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

Recommendations

• A lower bound on the expected length of one-to-one codes
• New bounds on the expected length of one-to-one codes
• scientific article; zbMATH DE number 3932941
• On One-to-One Codes for Memoryless Cost Channels
• Optimal noiseless coding of random variables (Corresp.)

Cited in

(9)

• scientific article; zbMATH DE number 1083083 (Why is no real title available?)
• scientific article; zbMATH DE number 3920367 (Why is no real title available?)
• Simple one-shot bounds for various source coding problems using smooth Rényi quantities
• Binary prefix codes ending in a "1"
• Optimal binary one-ended codes
• scientific article; zbMATH DE number 3932941 (Why is no real title available?)
• A lower bound on the expected length of one-to-one codes
• On One-to-One Codes for Memoryless Cost Channels
• A One-to-One Code and Its Anti-Redundancy

This page was built for publication: New Bounds on the Expected Length of Optimal One-to-One Codes

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