On One-to-One Codes for Memoryless Cost Channels

DOI10.1109/TIT.2007.911183zbMATH Open1308.94051MaRDI QIDQ3604597FDOQ3604597

Authors: S. A. Savari 

Publication date: 24 February 2009

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

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

zbMATH Keywords

source codingperformance boundsOne-to-one codes

Mathematics Subject Classification ID

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

Cited In (1)

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

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)