Optimal combinatorial batch code: monotonicity, lower and upper bounds

DOI10.1360/N012014-00061MaRDI QIDQ5018015zbMATH OpenFDO

Authors Junfang Chen, Gengsheng Zhang, Sumei Zhang

Publication date 17 December 2021

Published in SCIENTIA SINICA Mathematica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1360/N012014-00061

zbMATH Keywords

combinatorial batch codelower and upper boundsmonotonicity

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Recommendations

• A class of optimal combinatorial batch code
• Optimal combinatorial batch codes derived from dual systems
• The results on optimal values of some combinatorial batch codes
• Some optimal combinatorial batch codes with k=5
• Optimal batch codes: many items or low retrieval requirement

Cited in

(6)

• The results on optimal values of some combinatorial batch codes
• Some optimal combinatorial batch codes with k=5
• Erasure combinatorial batch codes based on nonadaptive group testing
• Combinatorial batch codes: extremal problems under Hall-type conditions
• Optimal combinatorial batch codes derived from dual systems
• A class of optimal combinatorial batch code

This page was built for publication: Optimal combinatorial batch code: monotonicity, lower and upper bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5018015)