Combinatorial batch codes
From MaRDI portal
Publication:2268236
DOI10.3934/amc.2009.3.13zbMath1191.05030OpenAlexW2055241129MaRDI QIDQ2268236
Maura B. Paterson, Rui Zhong Wei, Douglas R. Stinson
Publication date: 10 March 2010
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2009.3.13
Combinatorics in computer science (68R05) Extremal set theory (05D05) Other designs, configurations (05B30) Information storage and retrieval of data (68P20) Combinatorial codes (94B25)
Related Items (21)
The results on optimal values of some combinatorial batch codes ⋮ Linear Batch Codes ⋮ Fractional Repetition and Erasure Batch Codes ⋮ Batch codes from affine Cartesian codes and quotient spaces ⋮ Batch Codes from Hamming and Reed-M\"uller Codes ⋮ Derandomized Construction of Combinatorial Batch Codes ⋮ Some optimal combinatorial batch codes with \(k=5\) ⋮ Erasure combinatorial batch codes based on nonadaptive group testing ⋮ Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error ⋮ Lower bounds for (batch) PIR with private preprocessing ⋮ Sparse Hypergraphs with Applications to Coding Theory ⋮ Sparse hypergraphs: new bounds and constructions ⋮ On the term rank partition ⋮ Unnamed Item ⋮ On erasure combinatorial batch codes ⋮ Matrices in \(\mathcal{A}(R, S)\) with minimum \(t\)-term ranks ⋮ Multiset combinatorial batch codes ⋮ Optimal combinatorial batch codes based on block designs ⋮ On an extremal hypergraph problem related to combinatorial batch codes ⋮ On the \(t\)-term rank of a matrix ⋮ Turán numbers and batch codes
This page was built for publication: Combinatorial batch codes
