A lower bound on the expected length of one-to-one codes

DOI10.1109/18.333891MaRDI QIDQ4324151zbMATH OpenOpenAlexWikidataFDO

Authors Noga Alon, Alon Orlitsky

Publication date 1 March 1995

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

Full work available at URL https://semanticscholar.org/paper/d7a6259e14a214bca5261d094fd2e1fd5211bc15

zbMATH Keywords

expected lengthnonprefix codesone-to-one codessource coding

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• New bounds on the expected length of one-to-one codes
• scientific article; zbMATH DE number 4156353
• New Bounds on the Expected Length of Optimal One-to-One Codes
• Optimal noiseless coding of random variables (Corresp.)
• An achievable bound for optimal noiseless coding of a random variable (Corresp.)

Cited in

(13)

• A lower bound for 0,1,* tournament codes
• New lower bounds on the cost of binary search trees
• New Bounds on the Expected Length of Optimal One-to-One Codes
• On One-to-One Codes for Memoryless Cost Channels
• A One-to-One Code and Its Anti-Redundancy
• scientific article; zbMATH DE number 3920367 (Why is no real title available?)
• An achievable bound for optimal noiseless coding of a random variable (Corresp.)
• Optimal noiseless coding of random variables (Corresp.)
• scientific article; zbMATH DE number 31471 (Why is no real title available?)
• scientific article; zbMATH DE number 1083083 (Why is no real title available?)
• New bounds on the expected length of one-to-one codes
• Finite Blocklength Lossy Source Coding for Discrete Memoryless Sources
• Assembling approximately optimal binary search trees efficiently using arithmetics

This page was built for publication: A lower bound on the expected length of one-to-one codes

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