DocumentCode
1537841
Title
On relations between covering radius and dual distance
Author
Ashikhmin, Alexei E. ; Honkala, Iiro S. ; Laibonen, T.K. ; Litsyn, Simon N.
Author_Institution
Los Alamos Nat. Lab., NM, USA
Volume
45
Issue
6
fYear
1999
fDate
9/1/1999 12:00:00 AM
Firstpage
1808
Lastpage
1816
Abstract
The covering radius of a code tells us how far in the sense of Hamming distance an arbitrary word of the ambient space can be from the code. For a few decades this parameter has been widely studied. We estimate the covering ratios of a code when the dual distance is known. We derive a new bound on covering radii of linear codes. It improves essentially on the previously known estimates in a certain wide range. We also study asymptotic bounds on the cardinality of constant weight codes
Keywords
binary codes; error correction codes; linear codes; Hamming distance; ambient space; asymptotic bounds; bound; cardinality; constant weight codes; covering radius; dual distance; error correcting code; linear binary codes; Binary codes; Chebyshev approximation; Data compression; Decoding; Hamming distance; Laboratories; Linear code; Mathematics; Polynomials; Upper bound;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.782101
Filename
782101
Link To Document