Relaxations of Hall’s Condition: Optimal batch codes with multiple queries
From MaRDI portal
Publication:5396539
DOI10.2298/AADM111130024BzbMath1289.05450WikidataQ59072565 ScholiaQ59072565MaRDI QIDQ5396539
Publication date: 7 February 2014
Published in: Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)
Database theory (68P15) Extremal set theory (05D05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Information storage and retrieval of data (68P20)
Related Items (6)
Derandomized Construction of Combinatorial Batch Codes ⋮ On erasure combinatorial batch codes ⋮ Multiset combinatorial batch codes ⋮ Optimal combinatorial batch codes based on block designs ⋮ On an extremal hypergraph problem related to combinatorial batch codes ⋮ Turán numbers and batch codes
This page was built for publication: Relaxations of Hall’s Condition: Optimal batch codes with multiple queries