Covering Radius and the Chromatic Number of Kneser Graphs.

Let C be a binary linear code with covering radius R and let C sub o be a subcode of C with codimension i. We prove that the covering radius R sub o of C satisfies R sub o - 2R + 2 sup i - 1, by setting up a graph coloring problem involving Kneser graphs.