  We derive a linear programming bound on the maximum cardinality of
error-correcting codes in the sum-rank metric. Based on computational
experiments on relatively small instances, we observe that the obtained bounds
outperform all previously known bounds.
