Abstract
I read with interest Peter Pearson's article, “Fast Hashing of Variable-Length Text Strings” (June 1990, pp. 677-680). In it he defines a hash function, given a text C
1
… C
N
, by Exclusive OR'ing the bytes and modifying each intermediate result through a table of 256 randomish bytes.
Publisher
Association for Computing Machinery (ACM)
Reference4 articles.
1. Bell J.R. Kaman C.H. The linear quotient hash code. Commun. ACM 13 lI (Nov. 1970) pp. 675-677. 10.1145/362790.362797 Bell J.R. Kaman C.H. The linear quotient hash code. Commun. ACM 13 lI (Nov. 1970) pp. 675-677. 10.1145/362790.362797
2. Dittmer I. Implementation eines Einschrittcompilers for die Programmiersprache PASCAL auf der Rechenanlage IBM/360 der Universit it MOnster. Diplomarbeit Minster 1976 und doert angegebene Literatur. Dittmer I. Implementation eines Einschrittcompilers for die Programmiersprache PASCAL auf der Rechenanlage IBM/360 der Universit it MOnster. Diplomarbeit Minster 1976 und doert angegebene Literatur.
3. Knuth D.E. The Art of Computer Programming Volume 2: Seminumerical Algorithms. Addison-Wesley Reading Mass. 2nd ed. 1981. Knuth D.E. The Art of Computer Programming Volume 2: Seminumerical Algorithms. Addison-Wesley Reading Mass. 2nd ed. 1981.