The following pages link to Combinatorial batch codes (Q2268236):
Displaying 26 items.
- Combinatorial batch codes: a lower bound and optimal constructions (Q444518) (← links)
- Combinatorial batch codes and transversal matroids (Q540388) (← links)
- Optimal batch codes: many items or low retrieval requirement (Q644328) (← links)
- On an extremal hypergraph problem related to combinatorial batch codes (Q741768) (← links)
- On the \(t\)-term rank of a matrix (Q765173) (← links)
- Construction of extended Steiner systems for information retrieval (Q928357) (← links)
- The results on optimal values of some combinatorial batch codes (Q1620968) (← links)
- On erasure combinatorial batch codes (Q1783704) (← links)
- Multiset combinatorial batch codes (Q1791675) (← links)
- Batch codes from affine Cartesian codes and quotient spaces (Q2149781) (← links)
- Sparse hypergraphs: new bounds and constructions (Q2222044) (← links)
- On the term rank partition (Q2250922) (← links)
- Matrices in \(\mathcal{A}(R, S)\) with minimum \(t\)-term ranks (Q2282786) (← links)
- Turán numbers and batch codes (Q2345596) (← links)
- Some optimal combinatorial batch codes with \(k=5\) (Q2416426) (← links)
- Erasure combinatorial batch codes based on nonadaptive group testing (Q2420475) (← links)
- Combinatorial batch codes: extremal problems under Hall-type conditions (Q2857344) (← links)
- Derandomized Construction of Combinatorial Batch Codes (Q2947886) (← links)
- 基于RTD（q-2,q）的一类组合批处理码 (Q2983585) (← links)
- Linear Batch Codes (Q3460471) (← links)
- Fractional Repetition and Erasure Batch Codes (Q3460483) (← links)
- Batch codes and their applications (Q3580973) (← links)
- Sparse Hypergraphs with Applications to Coding Theory (Q5130902) (← links)
- Batch Codes from Hamming and Reed-M\"uller Codes (Q5241179) (← links)
- Optimal combinatorial batch codes based on block designs (Q5963364) (← links)
- Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error (Q6089979) (← links)
