Some optimal combinatorial batch codes with \(k=5\) (Q2416426): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On an extremal hypergraph problem related to combinatorial batch codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial batch codes: a lower bound and optimal constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial batch codes and transversal matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erratum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal batch codes: many items or low retrieval requirement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3106220 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batch codes and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3179839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial batch codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3615915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The results on optimal values of some combinatorial batch codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal combinatorial batch codes based on block designs / rank
 
Normal rank

Revision as of 08:00, 19 July 2024

scientific article
Language Label Description Also known as
English
Some optimal combinatorial batch codes with \(k=5\)
scientific article

    Statements

    Some optimal combinatorial batch codes with \(k=5\) (English)
    0 references
    0 references
    0 references
    23 May 2019
    0 references
    combinatorial batch code
    0 references
    dual set system
    0 references
    \(k\)-Hall condition
    0 references
    bipartite graph
    0 references

    Identifiers

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