DocumentCode
1304319
Title
An upper bound on the covering radius as a function of the dual distance
Author
Tietavainen, Aimo A.
Author_Institution
Dept. of Math., Turku Univ., Finland
Volume
36
Issue
6
fYear
1990
fDate
11/1/1990 12:00:00 AM
Firstpage
1472
Lastpage
1474
Abstract
P. Delsarte (1973) developed a method that gives an upper bound on the cardinality of a code as a function of its minimum distance. It is shown that, using a modification of that method, one gets an upper bound on the covering radius of a code as a function of its dual distance. As an interesting special case, the covering radius of the dual of a BCH code is considered
Keywords
error correction codes; BCH code; cardinality; code; covering radius; dual distance; minimum distance; upper bound; Equations; Error correction codes; Hamming weight; Information theory; Linear code; Notice of Violation; Upper bound;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.59949
Filename
59949
Link To Document