On the covering radius of subcodes of a code

Let C be a binary linear code with covering radius R, and C/sub 0/ a subcode of C of codimension i. An upper bound is obtained for the covering radius of C/sub 0/ in terms of R and i. When C/sub 0/ =(0), the bound becomes the sphere covering bound for R.<
>