New bounds on the expected length of one-to-one codes

DOI10.1109/18.481795zbMath0851.94010OpenAlexW1977014540WikidataQ114829832 ScholiaQ114829832MaRDI QIDQ4880008

Roberto De Prisco, Carlo Blundo

Publication date: 1 December 1996

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

Full work available at URL: https://doi.org/10.1109/18.481795

zbMATH Keywords

source codingone-to-one code

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Source coding (94A29)

Related Items (4)

New lower bounds on the cost of binary search trees ⋮ Entropy and compression: a simple proof of an inequality of Khinchin-Ornstein-Shields ⋮ Optimal binary search trees ⋮ Assembling approximately optimal binary search trees efficiently using arithmetics

This page was built for publication: New bounds on the expected length of one-to-one codes