Combinatorial batch codes: a lower bound and optimal constructions

DOI10.3934/amc.2012.6.165zbMath1244.05219arXiv1102.4951OpenAlexW2963487294MaRDI QIDQ444518

Srimanta Bhattacharya, Sushmita Ruj, Bimal K. Roy

Publication date: 14 August 2012

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

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

zbMATH Keywords

Hall's theorembinary constant weight codescombinatorial batch codes

Mathematics Subject Classification ID

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) Combinatorial codes (94B25)

Related Items (12)

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\) ⋮ Unnamed Item ⋮ 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: Combinatorial batch codes: a lower bound and optimal constructions