Some intriguing upper bounds for separating hash families (Q1729948)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Some intriguing upper bounds for separating hash families
scientific article

    Statements

    Some intriguing upper bounds for separating hash families (English)
    0 references
    0 references
    0 references
    0 references
    7 March 2019
    0 references
    separating hash families
    0 references
    Johnson-type recursive bound
    0 references
    graph removal lemma
    0 references
    probabilistic method
    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