Moment-based linear programming bounds for locally recoverable codes
New Delsarte-type linear programming bounds for $q$-ary $(r,\delta)$-locally recoverable codes (LRCs) are derived with three attributes: the variable set is comparable in size to that of the classical Delsarte LP, and the convex-hull LP yields improvements not captured by the previous LP and often sharpens the shorteni...