New Bounds on Parent-Identifying Codes: The Case of Multiple Parents
From MaRDI portal
Publication:4650640
Recommendations
- scientific article; zbMATH DE number 2154105
- A hypergraph approach to the identifying parent property: The case of multiple parents
- A hypergraph approach to the identifying parent property: The case of multiple parents
- On codes with the identifiable parent property
- Prolific Codes with the Identifiable Parent Property
Cited in
(21)- On optimal codes with \(w\)-identifiable parent property
- An upper bound on the size of a code with the \(k\)-identifiable parent property
- Probabilistic Existence Results for Parent-Identifying Schemes
- Constructions and bounds for separating hash families
- Generalized hashing and parent-identifying codes.
- A hypergraph approach to the identifying parent property: The case of multiple parents
- Upper Bounds for Set Systems with the Identifiable Parent Property
- A hypergraph approach to the identifying parent property: The case of multiple parents
- Upper bounds for parent-identifying set systems
- Prolific Codes with the Identifiable Parent Property
- New upper bounds for parent-identifying codes and traceability codes
- Some intriguing upper bounds for separating hash families
- Separating hash families: a Johnson-type bound and new constructions
- scientific article; zbMATH DE number 2154105 (Why is no real title available?)
- Improved upper bounds for parent-identifying set systems and separable codes
- Codes with the Identifiable Parent Property and the Multiple-Access Channel
- Traceability codes
- On generalized separating hash families
- Optimal 2-traceability codes of length 4
- Parent-identifying codes
- A bound on the size of separating hash families
This page was built for publication: New Bounds on Parent-Identifying Codes: The Case of Multiple Parents
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4650640)
