TY - JOUR
T1 - Generalized hashing and applications to digital fingerprinting
AU - Alon, Noga
AU - Cohen, Gérard
AU - Krivelevich, Michael
AU - Litsyn, Simon
PY - 2002
Y1 - 2002
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0036350053&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2002.1023708
DO - 10.1109/ISIT.2002.1023708
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0036350053
SN - 2157-8095
SP - 436
JO - IEEE International Symposium on Information Theory - Proceedings
JF - IEEE International Symposium on Information Theory - Proceedings
M1 - 436
ER -