"On the Application of Coding Theory to Hashing" by Nicholas Pippenger
 

Document Type

Article

Department

Mathematics (HMC)

Publication Date

1979

Abstract

Quick proofs are given for the characterization (due to Schay, Raver, Hanan, and Palermo) of the collision distance of a linear hashing function and for a dual function (called the restriction distance), which relates to the accessibility of addresses by sets of keys and the uniform distribution of sets of keys over addresses.

Rights Information

© 1979 International Business Machines Corporation

Terms of Use & License Information

Terms of Use for work posted in Scholarship@Claremont.

Download

Plum Print visual indicator of research metrics
PlumX Metrics
  • Usage
    • Downloads: 195
    • Abstract Views: 10
see details

Share

COinS