Explicit Constructions and Bounds for Batch Codes with Restricted Size of Reconstruction Sets
Information Theory
2017-07-05 v2 math.IT
Abstract
Linear batch codes and codes for private information retrieval (PIR) with a query size and a restricted size of the reconstruction sets are studied. New bounds on the parameters of such codes are derived for small values of or of by providing corresponding constructions. By building on the ideas of Cadambe and Mazumdar, a new bound in a recursive form is derived for batch codes and PIR codes.
Keywords
Cite
@article{arxiv.1701.07579,
title = {Explicit Constructions and Bounds for Batch Codes with Restricted Size of Reconstruction Sets},
author = {Eldho K. Thomas and Vitaly Skachek},
journal= {arXiv preprint arXiv:1701.07579},
year = {2017}
}
Comments
To appear in 5ICMCTA