Optimal batch codes: many items or low retrieval requirement
DOI10.3934/AMC.2011.5.529zbMATH Open1234.05006OpenAlexW2042664741WikidataQ59072642 ScholiaQ59072642MaRDI QIDQ644328FDOQ644328
Authors: Csilla Bujtás, Zsolt Tuza 
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
Recommendations
Permutations, words, matrices (05A05) Information storage and retrieval of data (68P20) Combinatorics in computer science (68R05) Hypergraphs (05C65) Extremal set theory (05D05)
Cited In (20)
- Batch codes and their applications
- Combinatorial batch codes and transversal matroids
- The results on optimal values of some combinatorial batch codes
- A class of optimal combinatorial batch code
- Optimal combinatorial batch code: monotonicity, lower and upper bounds
- Optimal combinatorial batch codes based on block designs
- Derandomized construction of combinatorial batch codes
- Combinatorial batch codes: a lower bound and optimal constructions
- Combinatorial batch codes based on RTD\((q-2, q)\)
- On an extremal hypergraph problem related to combinatorial batch codes
- Turán numbers and batch codes
- Multiset combinatorial batch codes
- Fractional repetition and erasure batch codes
- A survey of the study of combinatorial batch code
- Optimal combinatorial batch codes derived from dual systems
- Relaxations of Hall's condition: optimal batch codes with multiple queries
- Combinatorial batch codes
- Some optimal combinatorial batch codes with \(k=5\)
- On erasure combinatorial batch codes
- Erasure combinatorial batch codes based on nonadaptive group testing
This page was built for publication: Optimal batch codes: many items or low retrieval requirement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q644328)
