The Taub Faculty of Computer Science Events and Talks

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. The definition of such codes is motivated by applications to load balancing in distributed storage and private information retrieval. We develop new constructions of linear primitive batch codes based on finite geometries. In some parameter regimes, our codes have lower redundancy than previously known batch codes. Also, we prove new random coding bound on the redundancy of batch codes.

based on joint work with Nikita Polyansky.