| dc.contributor.author | Tutdere, Seher | |
| dc.date.accessioned | 2024-01-09T11:01:42Z | |
| dc.date.available | 2024-01-09T11:01:42Z | |
| dc.date.issued | 2022 | en_US |
| dc.identifier.issn | 2651-477X | |
| dc.identifier.uri | https://doi.org/10.15672/hujms.881649 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.12462/13760 | |
| dc.description.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 l satisfy r < R < l, where l, r are some integers, with l being odd, depending on the given code. This new class of cyclic codes covers that of Kavut and Tutdere. | en_US |
| dc.language.iso | eng | en_US |
| dc.publisher | Hacettepe Univ | en_US |
| dc.relation.isversionof | 10.15672/hujms.881649 | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.subject | Cyclic Code | en_US |
| dc.subject | Covering Radius | en_US |
| dc.subject | Finite Field | en_US |
| dc.subject | Polynomial Equations | en_US |
| dc.title | On the covering radii of a class of binary primitive cyclic codes | en_US |
| dc.type | article | en_US |
| dc.relation.journal | Hacettepe Journal of Mathematics and Statistics | en_US |
| dc.contributor.department | Fen Edebiyat Fakültesi | en_US |
| dc.contributor.authorID | 0000-0001-5645-8174 | en_US |
| dc.identifier.volume | 51 | en_US |
| dc.identifier.issue | 1 | en_US |
| dc.identifier.startpage | 20 | en_US |
| dc.identifier.endpage | 26 | en_US |
| dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
