ON THE COVERING RADIUS OF SOME BINARY CYCLIC CODES

Abstract

The binary cyclic codes of lenght $u=uv$ obtained by the factorization $4x^{uv}-1=(x-1)^2 \times \Bigg(\frac{x^u-1}{x-1} \Bigg) \Bigg(\frac{x^v-1}{x-1} \Bigg)$, where $u$ and $v$ are odd relatively prime numbers are considered. For these codes we find the covering radius (for two codes only upper and lower bound on covering radius)