Some optimal combinatorial batch codes with \(k=5\)

DOI10.1016/J.DAM.2019.02.031zbMath1411.05047OpenAlexW2921740592MaRDI QIDQ2416426

Dongdong Jia, Geng Sheng Zhang

Publication date: 23 May 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2019.02.031

zbMATH Keywords

bipartite graphdual set systemcombinatorial batch code\(k\)-Hall condition

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Extremal set theory (05D05) Other designs, configurations (05B30) Other types of codes (94B60) Information storage and retrieval of data (68P20) Source coding (94A29)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorial batch codes: a lower bound and optimal constructions
• Combinatorial batch codes and transversal matroids
• Optimal batch codes: many items or low retrieval requirement
• On an extremal hypergraph problem related to combinatorial batch codes
• The results on optimal values of some combinatorial batch codes
• Combinatorial batch codes
• Batch codes and their applications
• Optimal combinatorial batch codes based on block designs
• Erratum

This page was built for publication: Some optimal combinatorial batch codes with \(k=5\)