On the Generalized Covering Radii of Reed-Muller Codes

We study generalized covering radii, a fundamental property of linear codes that characterizes the trade-off between storage, latency, and access in linear data-query protocols such as PIR. We find the exact value of the generalized covering radii of Reed-Muller codes in certain extreme cases, as well as proving lower and upper bounds in various scenarios.