DocumentCode :
936559
Title :
Another upper bound on covering radius
Author :
Mattson, H.F.
Volume :
29
Issue :
3
fYear :
1983
fDate :
5/1/1983 12:00:00 AM
Firstpage :
356
Lastpage :
359
Abstract :
A new upper bound on the covering radius of binary linear codes improves on previously known bounds for some codes. The bound is ![[W/2]+\\rho_{2}](/images/tex/5664.gif)
, where 
is one of the weights occurring among the codewords, and 
is the covering radius of an associated code. Some comparisons with other bounds are made.
, where is one of the weights occurring among the codewords, and is the covering radius of an associated code. Some comparisons with other bounds are made.Keywords :
Linear coding; Galois fields; Geometry; Graph theory; Information theory; Linear code; Parity check codes; Phase change materials; Retirement; Testing; Upper bound;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1983.1056680
Filename :
1056680
Link To Document :
