Optimal batch codes: many items or low retrieval requirement
From MaRDI portal
Publication:644328
DOI10.3934/amc.2011.5.529zbMath1234.05006OpenAlexW2042664741WikidataQ59072642 ScholiaQ59072642MaRDI QIDQ644328
Publication date: 3 November 2011
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2011.5.529
Hypergraphs (05C65) Combinatorics in computer science (68R05) Permutations, words, matrices (05A05) Extremal set theory (05D05) Information storage and retrieval of data (68P20)
Related Items
The results on optimal values of some combinatorial batch codes ⋮ Fractional Repetition and Erasure Batch Codes ⋮ Derandomized Construction of Combinatorial Batch Codes ⋮ Some optimal combinatorial batch codes with \(k=5\) ⋮ Erasure combinatorial batch codes based on nonadaptive group testing ⋮ On erasure combinatorial batch codes ⋮ Multiset combinatorial batch codes ⋮ Optimal combinatorial batch codes based on block designs ⋮ On an extremal hypergraph problem related to combinatorial batch codes ⋮ Turán numbers and batch codes