An upper bound on the size of a code with the \(k\)-identifiable parent property
type: Item
instance of: scholarly article
title: An upper bound on the size of a code with the \(k\)-identifiable parent property
zbMATH Open document ID: 1020.94026
DOI: 10.1016/S0097-3165(03)00030-X
author: Simon R. Blackburn
published in: Journal of Combinatorial Theory. Series A
publication date: 2003-05-27T00:00:00Z
Mathematics Subject Classification ID: 94B25
Mathematics Subject Classification ID: 05E99
Mathematics Subject Classification ID: 94B65
zbMATH DE Number: 1917915
zbMATH Keywords: identifiable parent property
zbMATH Keywords: fingerprinting
zbMATH Keywords: upper bound
MaRDI profile type: Publication
cites work: Parent-identifying codes
cites work: New Bounds on Parent-Identifying Codes: The Case of Multiple Parents
cites work: A hypergraph approach to the identifying parent property: The case of multiple parents
cites work: Q4940701
cites work: On codes with the identifiable parent property
cites work: Combinatorial properties of frameproof and traceability codes
description: scientific article; zbMATH DE number 1917915