Designs, Codes and Cryptography Computer Science Applications

Cyclic completely regular codes $$C_{1,5}$$

Josep Rifà, Victor Zinoviev
Springer Nature · 2026-05-01 · DOI 10.1007/s10623-026-01860-8

Abstract

Abstract We construct a family of cyclic completely regular codes (CRCs) of length $$n=2^m-1$$ n = 2 m - 1 and compute their intersection arrays. These codes, denoted $$C_{1,5}$$ C 1 , 5 , are generated by the product $$m_1(x)m_5(x)$$ m 1 ( x ) m 5 ( x ) , where $$m_i(x)$$ m i ( x ) is the minimal polynomial of $$\alpha ^i$$ α i , and $$\alpha $$ α is a primitive element of the finite field $$\mathbb {F}_{2^m}$$ F 2 m . We consider two main cases: odd m and $$m \equiv 2 \pmod {4}$$ m ≡ 2 ( mod 4 ) . For odd m , these codes are known to be completely regular with covering radius $$\rho =3$$ ρ = 3 and minimum distance $$d=5$$ d = 5 . We prove that, for any m , the codes $$C_{1,3}$$ C 1 , 3 and $$C_{1,5}$$ C 1 , 5 are non-equivalent despite sharing the same parameters and intersection array. For $$m \equiv 2 \pmod {4}$$ m ≡ 2 ( mod 4 ) , we demonstrate that $$C_{1,5}$$ C 1 , 5 forms a new family of completely regular codes with covering radius $$\rho =3$$ ρ = 3 , minimum distance $$d=3$$ d = 3 , and intersection array $$\operatorname {IA}=[n, n-3, \frac{3n+7}{4}; 1, 4, \frac{n-3}{4}]$$ IA = [ n , n - 3 , 3 n + 7 4 ; 1 , 4 , n - 3 4 ] . Moreover, the corresponding extended cyclic codes $$C_{1,5}^*$$ C 1 , 5 ∗ are completely regular $$[n+1, n-2m, 4; 4]$$ [ n + 1 , n - 2 m , 4 ; 4 ] -codes with intersection array $$\operatorname {IA}=[n+1, n, n-3, \frac{3n+7}{4}; 1, 4, \frac{n-3}{4}, n+1]$$ IA = [ n + 1 , n , n - 3 , 3 n + 7 4 ; 1 , 4 , n - 3 4 , 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.

Read at publisher →