Jan 6, 2019 · The goal is to find the smallest number of servers for given k and s. We provide lower bounds on the number of servers and constructions which ...

Mar 2, 2020 · We provide some bounds on the minimum number of servers for functional k-batch codes. In particular we present a random construction and a ...

Abstract: A functional k-PIR code of dimension s consists of n servers storing linear combinations of s linearly independent information symbols.

Apr 15, 2019 · This section is devoted to lower bounds on the length of functional PIR codes ... We have considered the shortest length of functional PIR and ...

Abstract—A functional k-PIR code of dimension s consists of n servers storing linear combinations of s linearly inde- pendent information symbols.

A random construction and a construction based on simplex codes, WOM codes, and RIO codes are presented and some bounds on the number of servers for ...

Jul 7, 2019 · A functional k-PIR code of dimension s consists of n servers storing linear combinations of s linearly independent information symbols.

A functional k-batch code is a functional k-PIR code, where all the k linear combinations in the multiset are equal. We provide some bounds on the minimum ...

A functional k-batch code is a functional k-PIR code, where all the k linear combinations in the multiset are equal. We provide some bounds on the minimum ...

In this work we study two families of codes with availability, namely private information retrieval (PIR) codes and batch codes. While the former requires that ...