Name
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 |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1109/18.782101 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
asymptotic bound,hamming distance,dual distance,ambient space,linear code,certain wide range,constant weight code,arbitrary word,binary codes,indexing terms,polynomials,data compression,chebyshev approximation,cardinality,decoding,error correcting code,mathematics,upper bound | Hamming code,Discrete mathematics,Combinatorics,Covering code,Constant-weight code,Polynomial code,Block code,Cyclic code,Hamming distance,Linear code,Mathematics | Journal |
Volume | Issue | ISSN |
45 | 6 | 0018-9448 |
Citations | PageRank | References |
8 | 0.78 | 21 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alexei Ashikhmin | 1 | 2546 | 179.44 |
| I. S. Honkala | 2 | 31 | 3.67 |
| T. K. Laibonen | 3 | 8 | 0.78 |
| S. N. Litsyn | 4 | 77 | 12.69 |