Covering Radius of Melas Codes
IEEE Transactions on Information Theory, cilt.68, sa.7, ss.4354-4364, 2022 (SCI-Expanded)
- Yayın Türü: Makale / Tam Makale
- Cilt numarası: 68 Sayı: 7
- Basım Tarihi: 2022
- Doi Numarası: 10.1109/tit.2022.3152092
- Dergi Adı: IEEE Transactions on Information Theory
- Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED)
- Sayfa Sayıları: ss.4354-4364
- Anahtar Kelimeler: Melas code, covering radius, finite fields
- Orta Doğu Teknik Üniversitesi Adresli: Evet
Özet
IEEEWe prove that the covering radius of the Melas code M(m, q) of length n = qm - 1 over Fq is 2 if q > 3. We also prove that the covering radius of M(m, 3) is 3 is m ≥ 3, the covering radius of M(2, 3) is 4, and the covering radii of M(1, 2) and M(1, 3) are 1.