Speaker: Uri Stav (Tel-Aviv University)

Title: New bounds on parent-identifying codes

Abstract:
---------
A collection C of words of length n over an alphabet of size q is a code
with the identifiable parent property of order t if for any set S of at
most t codewords in C, one can identify at least one member of S from any
word whose i-th letter is the i-th letter of one of the members of S for
every i.  The study of such codes is motivated by problems about schemes
that protect against piracy of software. We describe some new bounds for
the maximum possible cardinality of such codes, obtaining nearly tight
bounds for fixed n and t, and large alphabet size q. 

Joint work with Noga Alon.