On One-to-One Codes for Memoryless Cost Channels

DOI10.1109/TIT.2007.911183MaRDI QIDQ3604597zbMATH OpenFDO

Authors S. A. Savari

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

zbMATH Keywords

One-to-one codesperformance boundssource coding

Mathematics Subject Classification ID

Source coding (94A29) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• New Bounds on the Expected Length of Optimal One-to-One Codes
• Coding with digits of unequal cost
• New bounds on the expected length of one-to-one codes
• Optimal Prefix Codes for Infinite Alphabets With Nonlinear Costs
• A lower bound on the expected length of one-to-one codes

Cited in

(3)

• New Bounds on the Expected Length of Optimal One-to-One Codes
• On channel capacity per unit cost
• Some notes on Varn coding

This page was built for publication: On One-to-One Codes for Memoryless Cost Channels

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