Combinatorial batch codes and transversal matroids
From MaRDI portal
(Redirected from Publication:540388)
Recommendations
Cited in
(18)- Optimal batch codes: many items or low retrieval requirement
- Combinatorial batch codes: extremal problems under Hall-type conditions
- On an extremal hypergraph problem related to combinatorial batch codes
- On the \(t\)-term rank of a matrix
- On the term rank partitions of matrices in
- Optimal combinatorial batch codes based on block designs
- Erasure combinatorial batch codes based on nonadaptive group testing
- Minimal matrices in the Bruhat order for symmetric (0,1)-matrices
- Turán numbers and batch codes
- Linear batch codes
- The results on optimal values of some combinatorial batch codes
- On erasure combinatorial batch codes
- Some optimal combinatorial batch codes with \(k=5\)
- On some batch code properties of the simplex code
- Derandomized construction of combinatorial batch codes
- Matrices in \(\mathcal{A}(R, S)\) with minimum \(t\)-term ranks
- On the term rank partition
- Multiset combinatorial batch codes
This page was built for publication: Combinatorial batch codes and transversal matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q540388)