The Length of Functional Batch and PIR Codes
By: Altan B. Kilic, Alberto Ravagnani, Flavio Salizzoni
Potential Business Impact:
Speeds up data downloads with fewer errors.
We consider the problem of computing the minimum length of functional batch and PIR codes of fixed dimension and for a fixed list size, over an arbitrary finite field. We recover, generalize, and refine several results that were previously obtained for binary codes. We present new upper and lower bounds for the minimum length, and discuss the asymptotic behaviour of this parameter. We also compute its value for several parameter sets. The paper also offers insights into the "correct" list size to consider for the Functional Batch Conjecture over non-binary finite fields, and establishes various supporting results.
Similar Papers
Serving Every Symbol: All-Symbol PIR and Batch Codes
Information Theory
Lets computers share secret info safely.
Finite-Blocklength Information Theory
Information Theory
Improves wireless signals for faster, more reliable communication.
Optimal Functional $2^{s-1}$-Batch Codes: Exploring New Sufficient Conditions
Information Theory
Helps servers share data more efficiently.