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

DOI10.1109/18.333891zbMath0811.94019OpenAlexW2098632144WikidataQ114830306 ScholiaQ114830306MaRDI QIDQ4324151

Alon Orlitsky, Noga Alon

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

source codingexpected lengthnonprefix codesone-to-one codes

Mathematics Subject Classification ID

Source coding (94A29)

Related Items (3)

New lower bounds on the cost of binary search trees ⋮ 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