Dipòsit Digital de Documents de la UAB
Publicación
Artículo científico (JournalArticle)
Cyclic completely regular codes C1,5
We construct a family of cyclic completely regular codes (CRCs) of length n=2m-1 and compute their intersection arrays. These codes, denoted C1,5, are generated by the product m1(x)m5(x), where mi(x) is the minimal polynomial of αi, and α is a primitive element of the finite field F2m. We consider two main cases: odd m and m≡2(mod4). For odd m, these codes are known to be completely regular with covering radius ρ=3 and minimum distance d=5. We prove that, for any m, the codes C1,3 and C1,5 are non-equivalent despite sharing the same parameters and intersection array. For m≡2(mod4), we demonstrate that C1,5 forms a new family of completely regular codes with covering radius ρ=3, minimum distance d=3, and intersection array IA=[n,n-3,3n+74;1,4,n-34]. Moreover, the corresponding extended cyclic codes C1,5∗ are completely regular [n+1,n-2m,4;4]-codes with intersection array IA=[n+1,n,n-3,3n+74;1,4,n-34,n+1]. We also describe the parameters and some properties of the coset graphs associated to these completely regular codes which form distance-regular graphs.