Parent-identifying codes

DOI10.1006/jcta.2001.3177zbMath0980.94039MaRDI QIDQ5947366

Eldar Fischer, Noga Alon, Mario Szegedy

Publication date: 6 March 2002

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcta.2001.3177

zbMATH Keywords

cardinality bounds; descendants; identifiable parent property

Mathematics Subject Classification ID

94B65: Bounds on codes

94B60: Other types of codes

Related Items

Separating Hash Families: A Johnson-type bound and New Constructions, Separation and Witnesses, 2-secure codes from 2-SFP codes, Computing Autotopism Groups of Partial Latin Rectangles, Maximum IPP codes of length 3, Jack van Lint (1932--2004): a survey of his scientific work, Generalized hashing and parent-identifying codes., New upper bounds for parent-identifying codes and traceability codes, Bounds and constructions for \(\overline {3}\)-strongly separable codes with length 3, Some intriguing upper bounds for separating hash families, An upper bound on the size of a code with the \(k\)-identifiable parent property, On 2-parent-identifying set systems of block size 4, Wide-sense 2-frameproof codes, Sparse hypergraphs: new bounds and constructions, On generalized separating hash families, Optimal 2-traceability codes of length 4

Cites Work

• Unnamed Item
• Unnamed Item
• On codes with the identifiable parent property
• Solving a linear equation in a set of integers I
• On Sets of Integers Which Contain No Three Terms in Arithmetical Progression