Universal coding of integers and unbounded search trees

Ahlswede R, Han TS, Kobayashi K (1997)
IEEE TRANSACTIONS ON INFORMATION THEORY 43(2): 669-682.

Zeitschriftenaufsatz | Veröffentlicht | Englisch
 
Download
Es wurden keine Dateien hochgeladen. Nur Publikationsnachweis!
DOI
Autor*in
Ahlswede, RudolfUniBi; Han, Te Sun; Kobayashi, Kingo
Einrichtung
Fakultät für Mathematik
Abstract / Bemerkung
In this paper we study universal coding problems for the integers, in particular, establish rather tight lower and upper bounds for the Elias omega code and other codes, In these bounds, the so-called log-star function plays a central role. Furthermore, we investigate unbounded search trees induced by these codes, including the Bentley-Yao search tree, We will reveal beautiful recursion structures latent in these search trees as well as in these codes. Finally, we introduce the modified log-star function to reveal the existance of better prefix codes than Elias omega code and other known codes.
Stichworte
universal coding; log-star function; Elias code; Stout; code; Bentley-Yao tree; search trees
Erscheinungsjahr
1997
Zeitschriftentitel
IEEE TRANSACTIONS ON INFORMATION THEORY
Band
43
Ausgabe
2
Seite(n)
669-682
ISSN
0018-9448
Page URI
https://pub.uni-bielefeld.de/record/1637805

Zitieren

Ahlswede R, Han TS, Kobayashi K. Universal coding of integers and unbounded search trees. IEEE TRANSACTIONS ON INFORMATION THEORY. 1997;43(2):669-682.
Ahlswede, R., Han, T. S., & Kobayashi, K. (1997). Universal coding of integers and unbounded search trees. IEEE TRANSACTIONS ON INFORMATION THEORY, 43(2), 669-682. https://doi.org/10.1109/18.556122
Ahlswede, Rudolf, Han, Te Sun, and Kobayashi, Kingo. 1997. “Universal coding of integers and unbounded search trees”. IEEE TRANSACTIONS ON INFORMATION THEORY 43 (2): 669-682.
Ahlswede, R., Han, T. S., and Kobayashi, K. (1997). Universal coding of integers and unbounded search trees. IEEE TRANSACTIONS ON INFORMATION THEORY 43, 669-682.
Ahlswede, R., Han, T.S., & Kobayashi, K., 1997. Universal coding of integers and unbounded search trees. IEEE TRANSACTIONS ON INFORMATION THEORY, 43(2), p 669-682.
R. Ahlswede, T.S. Han, and K. Kobayashi, “Universal coding of integers and unbounded search trees”, IEEE TRANSACTIONS ON INFORMATION THEORY, vol. 43, 1997, pp. 669-682.
Ahlswede, R., Han, T.S., Kobayashi, K.: Universal coding of integers and unbounded search trees. IEEE TRANSACTIONS ON INFORMATION THEORY. 43, 669-682 (1997).
Ahlswede, Rudolf, Han, Te Sun, and Kobayashi, Kingo. “Universal coding of integers and unbounded search trees”. IEEE TRANSACTIONS ON INFORMATION THEORY 43.2 (1997): 669-682.
Export

Markieren/ Markierung löschen
Markierte Publikationen

Open Data PUB

Web of Science

Dieser Datensatz im Web of Science®
Suchen in

Google Scholar