Title :
New lower bounds for covering codes
Author_Institution :
Dept. of Math., Illinois Univ., Chicago, IL, USA
fDate :
7/1/1990 12:00:00 AM
Abstract :
Some new lower bounds on |C| for a binary linear [n, k]R code C with n+1=t(R +1)-r(0⩽r<R+1, t>2 odd) or with n+1=t(R+1)-1(t>2 even) are obtained. These bounds improve the sphere covering bound considerably and give several new values and lower bounds for the function t[n, k], the smallest covering radius of any [n, k] code
Keywords :
codes; [n, k] code; binary linear code; covering codes; lower bounds; sphere covering bound; Binary codes; Concatenated codes; Encoding; Error correction codes; Gas insulated transmission lines; Linear code; Linearity; Network address translation; Notice of Violation; Welding;
Journal_Title :
Information Theory, IEEE Transactions on
