Linear programming bounds for storage codes

Extending Delsarte´s linear programming bound for error correcting codes, this paper obtains a linear programming bound for locally repairable storage codes. The number of variables involved in the bound scales linearity with the size of the code. The bound can also be viewed as a necessary condition for the existence of a storage code and be used to characterise the tradeoff among the costs for storage, repair and update.