2015/10/29 by Hui Zhang, Zhang, Hui, Vitaly Skachek +1
Computer Science · Mathematics · #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1510.08883
Submitted to ISIT 2016
arxiv created 2016/02/09 · arxiv updated 2016/02/10
We present new upper bounds on the parameters of batch codes with restricted query size. These bounds are an improvement on the Singleton bound. The techniques for derivations of these bounds are based on the ideas in the literature for codes with locality. By employing additional ideas, we obtain further improvements, which are specific for batch codes.