Universal coding of integers and unbounded search trees

DOI10.1109/18.556122MaRDI QIDQ4340335zbMATH OpenOpenAlexFDO

Authors Te Sun Han, Kingo Kobayashi, Rudolf Ahlswede

Publication date 20 July 1997

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

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

zbMATH Keywords

Bentley-Yao search treeElias omega codesearch treesStout codeuniversal coding

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45)

Recommendations

• A new recursive universal code of the positive integers
• More Nearly Optimal Algorithms for Unbounded Searching, Part I: The Finite Case
• On universal computably enumerable prefix codes
• Universal codes for finite sequences of integers drawn from a monotone distribution
• Linear time tree codes

Cited in

(4)

• Integer representation in the mixed base (2,3)
• Universal codes of the natural numbers
• More Nearly Optimal Algorithms for Unbounded Searching, Part I: The Finite Case
• A new recursive universal code of the positive integers

This page was built for publication: Universal coding of integers and unbounded search trees

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