.png){kind=icon}
.png){kind=icon}
Return
Cyclic completely regular codes C1,5
.png){kind=icon}
PRE
AI
DOI：10.1007/s10623-026-01860-8.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We construct a family of cyclic completely regular codes (CRCs) of length n = 2(m) - 1 and<br /> compute their intersection arrays. These codes, denoted C-1,C-5,C- are generated by the product<br /> m(1)(x)m(5)(x), where m(i) (x) is the minimal polynomial of alpha(i), and alpha is a primitive element of<br /> the finite field F-2m . We consider two main cases: odd m and m equivalent to 2 (mod 4). For odd m,<br /> these codes are known to be completely regular with covering radius rho = 3 and minimum<br /> distance d = 5.We prove that, for any m, the codes C-1,C-3 and C-1,C-5 are non-equivalent despite<br /> sharing the same parameters and intersection array. Form equivalent to 2 (mod 4),we demonstrate that<br /> C-1,C-5 forms a new family of completely regular codes with covering radius rho = 3, minimum<br /> distance d = 3, and intersection array IA = [n, n - 3, 3n+7/4; 1, 4, n-3/4]. Moreover, the<br /> corresponding extended cyclic codes C-1,5(& lowast;) are completely regular [n+1, n-2m, 4; 4]-codes<br /> with intersection array IA = [n + 1, n, n - 3, 3n+7/4; 1, 4, n-3/4 , n + 1]. We also describe the<br /> parameters and some properties of the coset graphs associated to these completely regular<br /> codes which form distance-regular graphs.
Keywords:
Completely regular codes
Cyclic codes
Distance regular graphs
Extended codes
Intersection array
Journal
D
IF:
1.2
Papers:
124
Citations:
3.2K