Journal of the ACM (JACM)
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
Elements of information theory
Elements of information theory
The analysis of hashing with lazy deletions
Information Sciences: an International Journal
Error control systems for digital communication and storage
Error control systems for digital communication and storage
Data structures and algorithm analysis in C (2nd ed.)
Data structures and algorithm analysis in C (2nd ed.)
Journal of Experimental Algorithmics (JEA)
An exponential open hashing function based on dynamical systems theory
An exponential open hashing function based on dynamical systems theory
Cryptography and network security (2nd ed.): principles and practice
Cryptography and network security (2nd ed.): principles and practice
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
A Note on the Efficiency of Hashing Functions
Journal of the ACM (JACM)
Data Structures, Algorithms and Object Oriented Programming
Data Structures, Algorithms and Object Oriented Programming
Number Theory for Computing
Uncertainty-Based Information: Elements of Generalized Information Theory
Uncertainty-Based Information: Elements of Generalized Information Theory
Hashing Methods for Temporal Data
IEEE Transactions on Knowledge and Data Engineering
Addressing for random-access storage
IBM Journal of Research and Development
One-way hash function construction based on 2D coupled map lattices
Information Sciences: an International Journal
| Hi-index | 0.07 |
In order to produce full length probe sequences, the table size m for many existing open addressing hash functions, for example, the widely used double hashing, must be prime, i.e., m=p where p is prime. In this paper, we propose a new and efficient open addressing technique, called hashing via finite field, to construct a new class of hash functions with table size m=p^n, where p is prime and n=1. It is clear that it includes prime m as a special case when n=1. We show that the new class of hash functions constructed via finite field produces full length probe sequences on all table elements. Also, some theoretic analysis is provided along with concrete examples.