New Bounds on Parent-Identifying Codes: The Case of Multiple Parents

DOI10.1017/S0963548304006388zbMath1154.94489MaRDI QIDQ4650640

Uri Stav, Noga Alon

Publication date: 18 February 2005

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

boundsIdentifiable Parent Propertymaximum possible cardinality

Mathematics Subject Classification ID

Bounds on codes (94B65) Other types of codes (94B60)

Related Items (13)

An upper bound on the size of a code with the \(k\)-identifiable parent property ⋮ Separating Hash Families: A Johnson-type bound and New Constructions ⋮ On optimal codes with \(w\)-identifiable parent property ⋮ New upper bounds for parent-identifying codes and traceability codes ⋮ Optimal 2-traceability codes of length 4 ⋮ Generalized hashing and parent-identifying codes. ⋮ Traceability codes ⋮ Some intriguing upper bounds for separating hash families ⋮ On generalized separating hash families ⋮ A bound on the size of separating hash families ⋮ Constructions and bounds for separating hash families ⋮ Upper bounds for parent-identifying set systems ⋮ Upper Bounds for Set Systems with the Identifiable Parent Property

This page was built for publication: New Bounds on Parent-Identifying Codes: The Case of Multiple Parents