Bounds on the Covering Radius of Linear Codes
Designs, Codes and Cryptography
WSEAS TRANSACTIONS on COMMUNICATIONS
The minimum distance of the dual of a CRC
CIMMACS'07 Proceedings of the 6th WSEAS international conference on Computational intelligence, man-machine systems and cybernetics
| Hi-index | 754.84 |
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