A tight bound for frameproof codes viewed in terms of separating hash families (Q2249796): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10623-013-9800-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1998969622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for separating hash families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for separating hash families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frameproof Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound on the size of separating hash families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collusion-secure fingerprinting for digital data / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalization of a Theorem due to MacNeish / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal Arrays of Index Unity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4940701 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3411976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941865 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructions of 2-cover-free families and related separating hash families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4788569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial properties of frameproof and traceability codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure frameproof codes, key distribution patterns, group testing algorithms and related structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalized separating hash families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Improved Bounds for Secure Frameproof Codes and Related Separating Hash Families / rank
 
Normal rank

Latest revision as of 17:56, 8 July 2024

scientific article
Language Label Description Also known as
English
A tight bound for frameproof codes viewed in terms of separating hash families
scientific article

    Statements

    A tight bound for frameproof codes viewed in terms of separating hash families (English)
    0 references
    0 references
    3 July 2014
    0 references
    0 references
    frameproof code
    0 references
    separating hash family
    0 references
    tight bound
    0 references
    0 references