Optimal combinatorial batch codes based on block designs

DOI10.1007/s10623-014-0007-9zbMath1401.94255arXiv1312.5505OpenAlexW3112923198MaRDI QIDQ5963364

Anna Gál, Natalia Silberstein

Publication date: 19 February 2016

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.5505

zbMATH Keywords

transversal designsaffine planesbatch codes

Mathematics Subject Classification ID

Other types of codes (94B60) Applications of design theory to circuits and networks (94C30)

Related Items (10)

The results on optimal values of some combinatorial batch codes ⋮ MaxMinSum Steiner Systems for Access Balancing in Distributed Storage ⋮ Linear Batch Codes ⋮ Batch codes from affine Cartesian codes and quotient spaces ⋮ Batch Codes from Hamming and Reed-M\"uller Codes ⋮ Some optimal combinatorial batch codes with \(k=5\) ⋮ Erasure combinatorial batch codes based on nonadaptive group testing ⋮ On the maximum double independence number of Steiner triple systems ⋮ Access balancing in storage systems by labeling partial Steiner systems ⋮ Multiset combinatorial batch codes

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
• Combinatorial batch codes
• Turán numbers and batch codes
• Upper bounds for constant-weight codes
• Batch codes and their applications
• Relaxations of Hall’s Condition: Optimal batch codes with multiple queries

This page was built for publication: Optimal combinatorial batch codes based on block designs