A class of optimal combinatorial batch code
From MaRDI portal
Publication:3179839
zbMATH Open1363.94104MaRDI QIDQ3179839FDOQ3179839
Authors: Dongdong Jia, Gengsheng Zhang, Lan-dang Yuan
Publication date: 6 January 2017
Recommendations
- Some optimal combinatorial batch codes with \(k=5\)
- Optimal combinatorial batch code: monotonicity, lower and upper bounds
- The results on optimal values of some combinatorial batch codes
- Optimal batch codes: many items or low retrieval requirement
- Optimal combinatorial batch codes derived from dual systems
Cited In (6)
- The results on optimal values of some combinatorial batch codes
- An implicit enumeration scheme for the batch selection problem
- Optimal combinatorial batch codes derived from dual systems
- Some optimal combinatorial batch codes with \(k=5\)
- On some batch code properties of the simplex code
- Erasure combinatorial batch codes based on nonadaptive group testing
This page was built for publication: A class of optimal combinatorial batch code
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3179839)