Abstract
Linear batch codes and codes for private information retrieval (PIR) with a query size t and a restricted size r of the reconstruction sets are studied. New bounds on the parameters of such codes are derived for small values of t or r 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.
Author supplied keywords
Cite
CITATION STYLE
Thomas, E. K., & Skachek, V. (2017). Constructions and bounds for batch codes with small parameters. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10495 LNCS, pp. 283–295). Springer Verlag. https://doi.org/10.1007/978-3-319-66278-7_24
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
