PIR Codes, Unequal-Data-Demand Codes, and the Griesmer Bound
Henk D.L. Hollmann, Martin Pu\v{s}kin, Ago-Erik Riet
TL;DR
This paper introduces Unequal-Data-Demand (UDD) PIR codes, a generalization of PIR codes for scenarios where some data parts are more in demand, and extends the Griesmer bound using ILP methods.
Contribution
It proposes UDD PIR codes for unequal data demand scenarios and generalizes the Griesmer bound through an ILP approach for linear UEP and UDD PIR codes.
Findings
Generalization of PIR codes to UDD codes for unequal data demand
Extension of the Griesmer bound via ILP for linear UEP and UDD PIR codes
New theoretical framework for analyzing error-correcting codes with unequal data importance
Abstract
Unequal Error-Protecting (UEP) codes are error-correcting (EC) codes designed to protect some parts of the encoded data better than other parts. Here, we introduce a similar generalization of PIR codes that we call Unequal-Data-Demand (UDD) PIR codes. These codes are PIR-type codes designed for the scenario where some parts of the encoded data are in higher demand than other parts. We generalize various results for PIR codes to UDD codes. Our main contribution is a new approach to the Griesmer bound for linear EC codes involving an Integer Linear Programming (ILP) problem that generalizes to linear UEP codes and linear UDD PIR codes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.