PIR- and batch-type codes
Coding and Information Transmission Group
Binary PIR and batch codes both encode blocks of data bits into code words and both facilitate the recovery from a code word of multiple data bits simultaneously, by inspecting disjoint parts of the code word. PIR codes are designed to handle multiple requests for the same data bit, while batch codes can handle requests for arbitrary sequences of data bits. t-PIR codes have applications for example in Private Information Retrieval (PIR), where they allow to reduce the storage overhead in t-server PIR schemes by emulating the t servers. Batch codes are employed for example in network switches for load-balancing purposes. Typically, problems on PIR and batch codes need techniques from combinatorics, linear algebra, and coding theory. The field is relatively new, so there are lots of interesting questions to work on, and there are also opportunities to write smart software for explorative purposes, or to survey parts of the literature. Research problems concern for example the understanding of the known examples of such codes and using these insights to generalize known examples or to investigate variants of these codes for scenarios where some parts of the data are in higher demand than other parts. For non-binary or for nonlinear PIR or batch codes, not much, respectively almost nothing is known.
Graduation Theses defence year
Henk D.L. Hollmann, Vitaly Skachek
Spoken language (s)
Requirements for candidates
Some background in combinatorics and/or coding theory would be helpful but is not required.
Application of contact
Henk D.L. Hollmann