On the Application of Coding Theory to Hashing | Zendy

Nicholas Pippenger | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On the Application of Coding Theory to Hashing

Author(s) -

Nicholas Pippenger

Publication year - 1979

Publication title -

ibm journal of research and development

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.47

H-Index - 95

eISSN - 2151-8556

pISSN - 0018-8646

DOI - 10.1147/rd.232.0225

Subject(s) - hash function , mathematical proof , universal hashing , dynamic perfect hashing , computer science , coding (social sciences) , coding theory , collision resistance , perfect hash function , theoretical computer science , collision , discrete mathematics , mathematics , double hashing , computer security , hash table , statistics , geometry

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 notion (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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research