Abstract
Lexicographic, digital, enumerative, Galois linear and polynomial methods of retrieval are called elementary. The first three of them are widely known. The Galois methods are defined in Sections 5.2 and 5.3. We present those retrieval algorithms in a non standard way: each of them determines a family of maps, which constitute a universal hash-set, a universal numerator in particular.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Notes
Cover T.M. (1973) Enumerative Source Encoding. IEEE. Trans. Inf. Th., Vol. IT-19(1), P. 73–73.
Knuth D.E. (1973) The Art of Computer Programming. 2nd ed., Addison—Wesley, Reading, MA, 3 volumes.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Krichevsky, R. (1994). Elementary Universal Sets. In: Universal Compression and Retrieval. Mathematics and Its Applications, vol 274. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-3628-2_7
Download citation
DOI: https://doi.org/10.1007/978-94-017-3628-2_7
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-4357-3
Online ISBN: 978-94-017-3628-2
eBook Packages: Springer Book Archive