Parent-identifying codes
From MaRDI portal
Publication:5947366
DOI10.1006/jcta.2001.3177zbMath0980.94039OpenAlexW2075524180MaRDI 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
Related Items (16)
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 ⋮ Jack van Lint (1932--2004): a survey of his scientific work ⋮ New upper bounds for parent-identifying codes and traceability codes ⋮ Separation and Witnesses ⋮ Computing Autotopism Groups of Partial Latin Rectangles ⋮ Bounds and constructions for \(\overline {3}\)-strongly separable codes with length 3 ⋮ Optimal 2-traceability codes of length 4 ⋮ Generalized hashing and parent-identifying codes. ⋮ Wide-sense 2-frameproof codes ⋮ Sparse hypergraphs: new bounds and constructions ⋮ Maximum IPP codes of length 3 ⋮ Some intriguing upper bounds for separating hash families ⋮ On generalized separating hash families ⋮ 2-secure codes from 2-SFP codes ⋮ On 2-parent-identifying set systems of block size 4
Cites Work
This page was built for publication: Parent-identifying codes