Abstract
Frameproof and identifying parent property codes and their relationship to hash families and error correcting codes are studied. A upper bound on the size of such codes is presented. A generalization of identifying parent property is introduced and studied in terms of a new class of hash families - the strong separating hash families. Asymptotic consequences of some recursive construction techniques are described.
Cite
CITATION STYLE
Sarkar, P., & Stinson, D. R. (2001). Frameproof and IPP Codes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2247, pp. 117–126). Springer Verlag. https://doi.org/10.1007/3-540-45311-3_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
