Improved batch code lower bounds

Abstract

Batch codes are a useful notion of locality for error correcting codes, originally introduced in the context of distributed storage and cryptography. Many constructions of batch codes have been given, but few lower bound (limitation) results are known, leaving gaps between the best known constructions and best known lower bounds. Towards determining the optimal redundancy of batch codes, we prove a new lower bound on the redundancy of batch codes. Specifically, we study (primitive, multiset) linear batch codes that systematically encode n information symbols, with the requirement that any multiset of k symbol requests can be obtained in disjoint ways. We show that such batch codes need $\Omega (\sqrt {nk} )$ symbols of redundancy, improving on the previous best lower bounds of $\Omega (\sqrt n + k)$ at all k = n <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ε</sup> with ε ∈ (0,1). Our proof follows from analyzing the dimension of the order-O(k) tensor of the batch code’s dual code.