We consider the problem of designing PIR scheme on coded data when certain
nodes are unresponsive. We provide the construction of ν-robust PIR schemes
that can tolerate up to ν unresponsive nodes. These schemes are adaptive
and universally optimal in the sense of achieving (asymptotically) optimal
download cost for any number of unresponsive nodes up to ν