Combinatorial batch codes provide a tool for distributed data storage, with possible application in reducing the computational overhead of private information retrieval protocol. Recently, Balachandran and Bhattacharya observed that the problem of constructing such uniform codes with some extremal properties can be formulated as a Turán-type question on hypergraphs. Here we establish general lower and upper bounds for this extremal problem, and also for its generalization where the forbidden family consists of those r-uniform hypergraphs H which satisfy the condition k ≥ |E(H)| > |V(H)| + q (for k > q + r and q > -r fixed). We also prove that, in the given range of parameters, the considered Turán function is asymptotically equal to the one restricted to |E(H)| = k, studied by Brown, Erdos and T. Sós. Both families contain some r-partite members - often called the 'degenerate case', characterized by the equality lim n → ∞ ex(n, F)/nr = 0 - and therefore their exact order of growth is not known.
- Combinatorial batch code
- Turán number
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Applied Mathematics