Technical Program

Paper Detail

Paper Title Constructions of batch codes via finite geometry
Paper IdentifierMO3.R3.3
Authors Nikita Polyanskii, Ilya Vorobyev, Skolkovo Institute of Science and Technology, Russia
Session Private Information Retrieval I
Location Monge, Level 3
Session Time Monday, 08 July, 14:30 - 16:10
Presentation Time Monday, 08 July, 15:10 - 15:30
Manuscript  Click here to download the manuscript
Abstract A primitive k-batch code encodes a string x of length n into string y of length N, such that each multiset of k symbols from x has k mutually disjoint recovering sets from y. We develop new explicit and random coding constructions of linear primitive batch codes based on finite geometry. In some parameter regimes, our proposed codes have lower redundancy than previously known batch codes.