Parent-identifying codes
From MaRDI portal
Recommendations
- Codes with the Identifiable Parent Property and the Multiple-Access Channel
- On codes with the identifiable parent property
- scientific article; zbMATH DE number 2154105
- A hypergraph approach to the identifying parent property: The case of multiple parents
- New Bounds on Parent-Identifying Codes: The Case of Multiple Parents
Cites work
- scientific article; zbMATH DE number 3641497 (Why is no real title available?)
- scientific article; zbMATH DE number 1256685 (Why is no real title available?)
- On codes with the identifiable parent property
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- Solving a linear equation in a set of integers I
Cited in
(18)- On codes with the identifiable parent property
- 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
- Separating hash families: a Johnson-type bound and new constructions
- Separation and Witnesses
- Codes with the Identifiable Parent Property and the Multiple-Access Channel
- 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
This page was built for publication: Parent-identifying codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5947366)
