Title :
On the covering radius of subcodes of a code
Author_Institution :
Dept. of Math. & Stat., Wright State Univ., Dayton, OH, USA
fDate :
11/1/1991 12:00:00 AM
Abstract :
Let C be a binary linear code with covering radius R , and C0 a subcode of C of codimension i. An upper bound is obtained for the covering radius of C 0 in terms of R and i. When C 0 ={0}, the bound becomes the sphere covering bound for R
Keywords :
codes; binary linear code; codimension; covering radius; sphere covering bound; subcodes; upper bound; Equations; Linear code; Parity check codes; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
