Optimal batch codes: many items or low retrieval requirement
From MaRDI portal
Recommendations
Cited in
(21)- The results on optimal values of some combinatorial batch codes
- On erasure combinatorial batch codes
- Multiset combinatorial batch codes
- Combinatorial batch codes
- Turán numbers and batch codes
- Some optimal combinatorial batch codes with k=5
- Erasure combinatorial batch codes based on nonadaptive group testing
- Derandomized construction of combinatorial batch codes
- Combinatorial batch codes based on RTD(q-2, q)
- A survey of the study of combinatorial batch code
- Optimal combinatorial batch codes derived from dual systems
- A class of optimal combinatorial batch code
- Fractional repetition and erasure batch codes
- Batch codes and their applications
- Combinatorial batch codes: a lower bound and optimal constructions
- Optimal combinatorial batch code: monotonicity, lower and upper bounds
- Relaxations of Hall's condition: optimal batch codes with multiple queries
- Combinatorial batch codes and transversal matroids
- Optimal combinatorial batch codes based on block designs
- On generalized combinatorial batch codes
- On an extremal hypergraph problem related to combinatorial batch codes
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)