PIR Codes, Unequal-Data-Demand Codes, and the Griesmer Bound
<|reference_start|>PIR Codes, Unequal-Data-Demand Codes, and the Griesmer Bound: 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.<|reference_end|>
@article{hollmann2024pir,
    title={PIR Codes, Unequal-Data-Demand Codes, and the Griesmer Bound},
    author={Henk D.L. Hollmann and Martin Puv{s}kin and Ago-Erik Riet},
    journal={Proceedings WCC 2024},
    year={2024},
    archivePrefix={arXiv},
    eprint={2407.18124},
    primaryClass={cs.IT math.CO math.IT}
}