On the covering radii of a class of binary primitive cyclic codes

Home Page
About
Submit A Journal
Submit A Conference
Submit Paper/Book
- Submit a Preprint
- Submit a Book
Contact

Hacettepe Journal of Mathematics and Statistics
Volume:51 Issue:1
On the covering radii of a class of binary primitive cyclic codes

On the covering radii of a class of binary primitive cyclic codes

Pages : 20-26

View : 24 | Download : 14

Publication Date : 2022-02-14

Article Type : Research Paper

Abstract : In 2019, Kavut and Tutdere proved that the covering radii of a class of primitive binary cyclic codes with minimum distance greater than or equal to $r+2$ is $r$, where $r$ is an odd integer, under some assumptions. We here show that the covering radii $R$ of a class of primitive binary cyclic codes with minimum distance strictly greater than $\ell$ satisfy $r\leq R \leq \ell$, where $\ell,r$ are some integers, with $\ell$ being odd, depending on the given code. This new class of cyclic codes covers that of Kavut and Tutdere.
Keywords : cyclic code, covering radius, finite field, polynomial equations

ORIGINAL ARTICLE URL

VIEW PAPER (PDF)

* There may have been changes in the journal, article,conference, book, preprint etc. informations. Therefore, it would be appropriate to follow the information on the official page of the source. The information here is shared for informational purposes. IAD is not responsible for incorrect or missing information.