DocumentCode
2253045
Title
Universal coding of integers and unbounded search trees
Author
Ahlswede, R. ; Han, T.S. ; Kobayashi, K.
Author_Institution
Fakultat fur Math., Bielefeld Univ., Germany
fYear
1995
fDate
17-22 Sep 1995
Firstpage
19
Abstract
We study the universal coding problem for the integers, in particular, establish rather sharp lower and upper bounds for the Elias (1975) omega code and other codes. For these bounds, the so-called log-star function plays the central role. Furthermore, we investigate unbounded search trees induced by these codes, including the Bentley-Yao (1976) search tree
Keywords
functions; source coding; tree searching; Bentley-Yao search tree; Elias omega code; integers; log-star function; lower bounds; source coding; unbounded search trees; universal coding; upper bounds; Argon; Code standards; Computer science; Delay; Encoding; Information systems; Information theory; Light rail systems; Mathematics; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
Conference_Location
Whistler, BC
Print_ISBN
0-7803-2453-6
Type
conf
DOI
10.1109/ISIT.1995.531121
Filename
531121
Link To Document