论文信息 - Combinatorial batch codes: Extremal problems under Hall-type conditions

Combinatorial batch codes: Extremal problems under Hall-type conditions

Abstract We study set (multi)systems F of size n over an m-element underlying set, such that for any at most k members of F a system of representatives can be chosen in which each element represents at most t selected members. The purpose is to minimize the total size ∑ F ∈ F | F | for given parameters n, k, m, t.

Csilla Bujtás | Zsolt Tuza

[1] Sushmita Ruj,et al. Combinatorial batch codes: A lower bound and optimal constructions , 2012, Adv. Math. Commun..

[2] Richard A. Brualdi,et al. Combinatorial batch codes and transversal matroids , 2010, Adv. Math. Commun..

[3] Rafail Ostrovsky,et al. Batch codes and their applications , 2004, STOC '04.

[4] Douglas R. Stinson,et al. Combinatorial batch codes , 2009, Adv. Math. Commun..

[5] Csilla Bujtás,et al. Optimal combinatorial batch codes derived from dual systems , 2011 .

[6] Csilla Bujtás,et al. Optimal batch codes: Many items or low retrieval requirement , 2011, Adv. Math. Commun..

[7] P. Hall. On Representatives of Subsets , 1935 .

[8] Csilla Bujtás,et al. Relaxations of Hall's condition: Optimal batch codes with multiple queries , 2012 .