Multiset combinatorial batch codes
From MaRDI portal
Publication:1791675
DOI10.1007/s10623-018-0468-3zbMath1398.94235arXiv1701.02708OpenAlexW2792212312MaRDI QIDQ1791675
Hui Zhang, Eitan Yaakobi, Natalia Silberstein
Publication date: 10 October 2018
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1701.02708
Hypergraphs (05C65) Combinatorics in computer science (68R05) Extremal set theory (05D05) Other types of codes (94B60) Information storage and retrieval of data (68P20) Combinatorial codes (94B25)
Related Items
Cites Work
- Unnamed Item
- 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
- On a possible extension of Hall's theorem to bipartite hypergraphs
- Combinatorial batch codes
- Turán numbers and batch codes
- Locality and Availability in Distributed Storage
- A new table of constant weight codes
- Fractional Repetition and Erasure Batch Codes
- Batch codes and their applications
- Lower bounds for constant weight codes
- Relaxations of Hall’s Condition: Optimal batch codes with multiple queries
- Systems of representatives
- Optimal combinatorial batch codes based on block designs
