Recommendations
Cited in
(31)- Sparse hypergraphs with applications to coding theory
- Lower bounds for (batch) PIR with private preprocessing
- Batch codes and their applications
- Batch codes from affine Cartesian codes and quotient spaces
- Combinatorial batch codes and transversal matroids
- The results on optimal values of some combinatorial batch codes
- On the term rank partition
- Derandomized construction of combinatorial batch codes
- Optimal combinatorial batch codes based on block designs
- The service rate region polytope
- Combinatorial batch codes: a lower bound and optimal constructions
- Batch codes from Hamming and Reed-Muller codes
- 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
- Matrices in \(\mathcal{A}(R, S)\) with minimum \(t\)-term ranks
- Multiset combinatorial batch codes
- Fractional repetition and erasure batch codes
- On the \(t\)-term rank of a matrix
- A survey of the study of combinatorial batch code
- Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error
- Optimal combinatorial batch codes derived from dual systems
- Optimal batch codes: many items or low retrieval requirement
- Relaxations of Hall's condition: optimal batch codes with multiple queries
- Construction of extended Steiner systems for information retrieval
- Linear batch codes
- Some optimal combinatorial batch codes with k=5
- On erasure combinatorial batch codes
- Erasure combinatorial batch codes based on nonadaptive group testing
- Sparse hypergraphs: new bounds and constructions
- Combinatorial batch codes: extremal problems under Hall-type conditions
This page was built for publication: Combinatorial batch codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2268236)
