An upper bound on the size of a code with the \(k\)-identifiable parent property (Q1873820): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parent-identifying codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Bounds on Parent-Identifying Codes: The Case of Multiple Parents / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4940701 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On codes with the identifiable parent property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial properties of frameproof and traceability codes / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:11, 5 June 2024

scientific article
Language Label Description Also known as
English
An upper bound on the size of a code with the \(k\)-identifiable parent property
scientific article

    Statements

    An upper bound on the size of a code with the \(k\)-identifiable parent property (English)
    0 references
    0 references
    27 May 2003
    0 references
    identifiable parent property
    0 references
    fingerprinting
    0 references
    upper bound
    0 references

    Identifiers