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.
cyclic code covering radius finite field polynomial equations
Birincil Dil | İngilizce |
---|---|
Konular | Matematik |
Bölüm | Matematik |
Yazarlar | |
Yayımlanma Tarihi | 14 Şubat 2022 |
Yayımlandığı Sayı | Yıl 2022 Cilt: 51 Sayı: 1 |