DocumentCode
969094
Title
Covering radius, codimension, and dual-distance width
Author
Sole, Patrick ; Stokes, Philip
Author_Institution
Lab. I.3.S., CNRS, Valbonne, France
Volume
39
Issue
4
fYear
1993
fDate
7/1/1993 12:00:00 AM
Firstpage
1195
Lastpage
1203
Abstract
Upper bounds on the covering radius of codes with a given cardinality and a given dual-distance width are derived. Using an entirely new method, some results published by C. Delorme and P. Sole (1991) for linear codes are generalized, and results are derived for unrestricted codes that have no previous analogue. For some classes of codes, when the parameters lie within certain intervals, results improve asymptotically on the upper bounds published by A.A. Tietavainen (1990) relating the covering radius with the dual distance
Keywords
codes; group theory; cardinality; codimension; covering radius; dual-distance width; group algebras; linear codes; unrestricted codes; upper bounds; Algebra; Binary codes; Character generation; Councils; Galois fields; Information theory; Linear code; Polynomials; Upper bound;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.243438
Filename
243438
Link To Document