Optimal combinatorial batch codes derived from dual systems

MaRDI QIDQ3106220zbMATH OpenFDO

Authors Csilla Bujtás, Zsolt Tuza

Publication date 19 December 2011

zbMATH Keywords

combinatorial batch codedual systemHall's conditionsystem of distinct representatives

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Hypergraphs (05C65) Combinatorics in computer science (68R05)

Recommendations

• Optimal batch codes: many items or low retrieval requirement
• Optimal combinatorial batch code: monotonicity, lower and upper bounds
• A class of optimal combinatorial batch code
• Some optimal combinatorial batch codes with k=5
• Combinatorial batch codes

Cited in

(18)

• The results on optimal values of some combinatorial batch codes
• On erasure combinatorial batch codes
• Multiset combinatorial batch codes
• Batch codes from affine Cartesian codes and quotient spaces
• Turán numbers and 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
• A class of optimal combinatorial batch code
• Optimal combinatorial batch code: monotonicity, lower and upper bounds
• Batch codes from Hamming and Reed-Muller codes
• Relaxations of Hall's condition: optimal batch codes with multiple queries
• Combinatorial batch codes and transversal matroids
• Optimal combinatorial batch codes based on block designs
• Design of extended dense coding protocol strategy based on combinatorial optimization
• Optimal batch codes: many items or low retrieval requirement
• On generalized combinatorial batch codes
• On an extremal hypergraph problem related to combinatorial batch codes

This page was built for publication: Optimal combinatorial batch codes derived from dual systems

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