New bounds for perfect \(k\)-hashing (Q2217492): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4283429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound on the zero-error list-coding capacity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A gap in the slice rank of \(k\)-tensors / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Bound on the Zero-Error List-Decoding Capacity of the 4/3 Channel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero error capacity under list decoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Size of Separating Systems and Families of Perfect Hash Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beating Fredman-Komlós for Perfect k-Hashing. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5547602 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4053473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fredman–Komlós bounds and information theory / 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: Hide and Seek, Data Storage, and Entropy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect Hashing and Probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: An entropy proof of Bregman's theorem / rank
 
Normal rank

Revision as of 06:01, 24 July 2024

scientific article
Language Label Description Also known as
English
New bounds for perfect \(k\)-hashing
scientific article

    Statements

    Identifiers

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