Conditional recurrences and 2-quasi-cyclic codes
Journal of Algebraic Combinatorics, cilt.64, sa.2, 2026 (SCI-Expanded, Scopus)
- Yayın Türü: Makale / Tam Makale
- Cilt numarası: 64 Sayı: 2
- Basım Tarihi: 2026
- Doi Numarası: 10.1007/s10801-026-01582-z
- Dergi Adı: Journal of Algebraic Combinatorics
- Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Aerospace Database, MathSciNet, zbMATH, Materials Science & Engineering Collection (ProQuest), Technology Collection (ProQuest)
- Anahtar Kelimeler: Cyclic codes, Quasi-cyclic codes, Strongly regular graphs, Weight distribution
- Ankara Üniversitesi Adresli: Evet
Özet
In this paper, we introduce a construction method for a family of quasi-cyclic linear codes based on combinations of linear recurrence relations. Using this approach, we determine the weight distributions of a class of 2-quasi-cyclic codes. As an application, we provide two examples of strongly regular graphs whose corresponding codes are nonprojective. In addition, we show that some of the constructed codes are almost maximum distance separable (AMDS). In particular, one of the resulting graphs is the Paley graph.