Combinatorial batch codes and transversal matroids
DOI10.3934/AMC.2010.4.419zbMATH Open1290.05048OpenAlexW1974719812MaRDI QIDQ540388FDOQ540388
Authors: Richard A. Brualdi, Kathleen P Kiernan, Seth A. Meyer, Michael W. Schroeder 
Publication date: 3 June 2011
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2010.4.419
Recommendations
transversal matroidcombinatorial batch codescocircuitdual matroidpresentation of a transversal matroid
Information storage and retrieval of data (68P20) Combinatorics in computer science (68R05) Cryptography (94A60) Other designs, configurations (05B30) Combinatorial aspects of matroids and geometric lattices (05B35) Extremal set theory (05D05) Other types of codes (94B60)
Cited In (18)
- Minimal matrices in the Bruhat order for symmetric (0,1)-matrices
- The results on optimal values of some combinatorial batch codes
- On the term rank partition
- Optimal combinatorial batch codes based on block designs
- Derandomized construction of combinatorial batch codes
- 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
- On the \(t\)-term rank of a matrix
- On the term rank partitions of matrices in
- Optimal batch codes: many items or low retrieval requirement
- Linear batch codes
- Some optimal combinatorial batch codes with \(k=5\)
- On erasure combinatorial batch codes
- On some batch code properties of the simplex code
- Erasure combinatorial batch codes based on nonadaptive group testing
- Combinatorial batch codes: extremal problems under Hall-type conditions
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)
