Separating Hash Families: A Johnson-type bound and New Constructions (Q5298169): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Generalized hashing and parent-identifying codes. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Algorithmic Aspects of the Regularity Lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parent-identifying codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an extremal hypergraph problem of Brown, Erdős and Sós / 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: 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: On Sets of Integers Which Contain No Three Terms in Arithmetical Progression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect hash families: Probabilistic methods and explicit constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4432207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frameproof Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound on the size of a code with the \(k\)-identifiable parent property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Multiplicative Sharing Schemes / 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: On the existence of triangulated spheres in 3-graphs, and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5672676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent / rank
 
Normal rank
Property / cites work
 
Property / cites work: On coloring graphs to maximize the proportion of multicolored k-edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect hash families of strength three with three rows from varieties on finite projective geometries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform hypergraphs containing no grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3137758 / 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: New bounds for perfect hashing via information theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit constructions for perfect hash families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on Formula Size of Boolean Functions Using Hypergraph Entropy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect Hashing and Probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a linear equation in a set of integers I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4175585 / 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: Secure frameproof codes, key distribution patterns, group testing algorithms and related structures / 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: On generalized separating hash families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect Hash Families: Constructions and Existence / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963711761 / rank
 
Normal rank

Latest revision as of 10:26, 30 July 2024

scientific article; zbMATH DE number 6663069
Language Label Description Also known as
English
Separating Hash Families: A Johnson-type bound and New Constructions
scientific article; zbMATH DE number 6663069

    Statements

    Separating Hash Families: A Johnson-type bound and New Constructions (English)
    0 references
    0 references
    0 references
    13 December 2016
    0 references
    separating hash family
    0 references
    perfect hash family
    0 references
    Johnson-type bound
    0 references
    rainbow cycle
    0 references
    \(R\)-sum-free set
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references