Generalized hashing and applications to digital fingerprinting

Noga Alon, Gérard Cohen, Michael Krivelevich, Simon Litsyn

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


Let C be a code of length n over an alphabet of q letters. An n-word y is called a descendant of a set of t codewords x1,…, xt if yi ∈ (xi1,…, xit) for all i = 1,…, n. A code is said to have the t-identifying parent property if for any n-word that is a descendant of at most t parents it is possible to identify at least one of them. We study a generalization of hashing, (t, u)-hashing, which ensures identification, and provide tight estimates of the rates.

Original languageEnglish (US)
Article number436
Pages (from-to)436
Number of pages1
JournalIEEE International Symposium on Information Theory-Proceedings
StatePublished - 2002
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics


Dive into the research topics of 'Generalized hashing and applications to digital fingerprinting'. Together they form a unique fingerprint.

Cite this