The results on optimal values of some combinatorial batch codes
From MaRDI portal
Publication:1620968
DOI10.3934/AMC.2018040zbMath1417.94116OpenAlexW2893759020MaRDI QIDQ1620968
Dongdong Jia, Yuebo Shen, Geng Sheng Zhang
Publication date: 15 November 2018
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2018040
Other designs, configurations (05B30) Information storage and retrieval of data (68P20) Combinatorial codes (94B25)
Related Items (2)
Some optimal combinatorial batch codes with \(k=5\) ⋮ Erasure combinatorial batch codes based on nonadaptive group testing
Cites Work
- Combinatorial batch codes: a lower bound and optimal constructions
- Combinatorial batch codes and transversal matroids
- Optimal batch codes: many items or low retrieval requirement
- Combinatorial batch codes
- Batch codes and their applications
- Optimal combinatorial batch code: Monotonicity, lower and upper bounds
- Optimal combinatorial batch codes based on block designs
- Erratum
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The results on optimal values of some combinatorial batch codes
