  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.
