Synchronization and chimera states in the network of electrochemically coupled memristive Rulkov neuron maps

1.   Introduction

Cyclically permutable codes (CPCs), originally introduced by Gilbert in the early $1960$s ^[1], make up a binary block code of code length $n$ such that each codeword has a cyclic order $n$ and the codewords are cyclically distinct. CPCs have many applications in communication networks, for example, as protocol sequences ^[2,3], and in watermarking systems ^[4]. Additionally, non-binary CPCs have applications in direct sequence code division multiple access systems with asynchronous base stations ^[5], as well as in the construction of frequency-hopping sequence sets ^[6,7,8,9]. Therefore, they are the focus of great theoretical interest and have practical significance in the study and exploration of $q$-ary CPCs ^{[5,6,10,11,12,13,14]}.

Cyclic codes are considered important in theoretical studies because they posses a very rich mathematical structure. So, it seems possible to provide a useful framework to generate CPCs by choosing the codewords that are cyclically distinct and have maximal cyclic order. More specifically, one has an equivalence relationship for any cyclic code $C$: Two codewords of $C$ are said to be equivalent if one can be obtained from the other by applying the cyclic shift a certain number of times. The equivalence class whose elements have full cyclic order is called a nonperiodic cyclic equivalence class (see ^[15] or ^[8]). Picking up exactly one member from each of the nonperiodic cyclic equivalence classes of $C$ yields a CPC, which is denoted by $C'$. Note that $C'$ is certainly not unique by its very definition, and that $C'$ is a CPC that is derived from $C$ with the largest possible code size. There are two basic questions that are attractive for mathematical investigations and practical applications: Q1: how to determine the exact value of $|C'|$ for a given arbitrary cyclic code $C$ where $|C'|$ denotes the size of $C'$; Q2: how to find a general construction scheme that produces $C'$ for an arbitrary cyclic code $C$.

Making use of a combinatorial technique known as the Möbius inversion formula, a group of authors, first in ^[16] and consequently in ^[17], found enumerative formulas for the value of $|C'|$, where $C$ is a binary simple-root cyclic code. Song et al. ^[8] also utilized the Möbius function to obtain an enumerative formula for the size of $C'$, where $C$ is a Reed-Solomon (RS) code. Combining the Möbius inversion formula with some elementary properties of cyclic codes, Xia and Fu ^[18] determined the value of $|C'|$, where $C$ is a $q$-ary simple-root cyclic code.

Compared with Q1, it seems that the method for deriving CPCs from a general cyclic code is still a challenging problem, even for the binary case. Maracle and Wolverton ^[13] provided an efficient algorithm to generate cyclically inequivalent subsets. In ^[18], Xia and Fu presented several algebraic constructions of subcodes of $C'$, where the codes $C$ are particular classes of cyclic codes. Here, by using the check polynomial approach, Xia and Fu obtained subcodes of $C'$ from special classes of cyclic codes $C$, all of which have code sizes that are strictly less than $|C'|$. Kuribayashi and Tanaka ^[19] first provided an efficient and systematic method to construct a $C'$ from a binary cyclic code $C$ when the code length $n$ is a Mersenne prime, i.e., $n$ is a prime number in the form $2^m-1$ for some $m$. Lemos-Neto and da Rocha ^[12] gave a necessary and sufficient condition on the generator polynomial of a cyclic code $\mathcal{C}$ under which any nonzero codeword of $C$ has full cyclic order; further, in the same paper ^[12], the authors continued to provide an effective method to find CPCs from $C$, where $C$ is a cyclic code of length $n = q^m-1$. Nguyen et al. ^[3] proposed a novel procedure to obtain CPCs from RS codes of lengths $p-1$ and $p+1$, respectively, where $p$ is a prime number. Using the discrete Fourier transform, Yang et al. ^[20] developed an efficient algorithm to produce a CPC from a $p$-ary cyclic code, where $p$ is a prime number. Extending the results of ^[3,20], Cho et al. ^[21] proposed an effective algorithm to generate CPCs from a prime-length cyclic code. Recently, Bastos and Lemos-Neto ^[22] presented a method to obtain a CPC from a simple-root cyclic code by using the $x$-cyclotomic coset. More specifically, the determinant of codewords of $C'$ is dependent on that of the $x$-cyclotomic coset modulo $h(x)$, where $h(x)$ is a divisor of $x^n-1$.

In this paper, we aim to give the generalization of CPCs, which are called constacyclically permutable codes (CCPCs), and to introduce a method to derive a CCPC from a given constacyclic code. More specifically, let $C$ be a given $\lambda$-constacyclic code of length $n$ over $\mathbb{F}$, where $\lambda$ is a nonzero element of $\mathbb{F}$ with order $t$, and $\phi$ be the cyclic shift of $C$. Two codewords $c_1, c_2$ of $C$ are said to be equivalent if there is an integer $r$ such that $\phi^r(c_1) = c_2$. In other words, the cyclic subgroup $\langle \phi\rangle$ of the automorphism group of $C$ generated by the cyclic shift $\phi$ acts naturally on the constacyclic code $C$; then, $c_1$ and $c_2$ are equivalent if and only if they are in the same orbit. For an element $c$ of $C$, if the length of the orbit containing $c$ is $nt$, that is, $nt$ is the least positive integer satisfying that $\phi^{nt}(c) = c$, then we state that $c$ has full constacyclic order. The orbit of size $nt$ is called the nonperiodic constacyclic equivalence class. A CCPC generated from $C$ is formed by taking exactly one element from each nonperiodic constacyclic equivalence class of $C$, denoted still as $C'$. Similar to the case of CPCs, we focus on solving the following problem: For a given arbitrary constacyclic code $C$, we want to determine the exact value of $|C'|$, where $|C'|$ denotes the size of $C'$, and to find a general construction scheme that produces $C'$. To this end, we use the language of group actions to reinterpret that $C'$ is merely a representative of the $n$-length orbits of $\langle \phi\rangle$ on $C$, where $\langle \phi\rangle$ is the cyclic subgroup of the automorphism group of $C$ generated by the cyclic shift $\phi$. One of the advantages of our new approach lies in that the codewords of $C$ are presented in terms of the primitive idempotents of $C$. Based on this approach, we present a new enumerative formula for the code size of such a CCPC with all of the terms being positive integers. On the other hand, we provide an algebraic method to produce such a CCPC.

This paper is organized as follows. We provide the basic notation and some results about constacyclic codes in Section 2. An enumerative formula for the exact value of $|C'|$ is given in Section 3. Section 4 proposes an effective method to generate $C'$, where $C$ is any simple-root constacyclic code, and presents an example to illustrate our main results.

2.   Preliminaries

Let $q$ be a prime power and $n$ be a positive integer that is coprime with $q$. Let $\mathbb{F}_q$ denote a finite field with $q$ elements and $\mathbb{F}_q^{\times}$ denote the set of all nonzero elements of $\mathbb{F}_q$, that is, $\mathbb{F}_q^{\times} = \mathbb{F}_q\backslash \{0\}$. Let $x$ be an indeterminate over $\mathbb{F}_q$ and $\mathbb{F}_q[x]$ be the polynomial ring in variable $x$ with coefficients in $\mathbb{F}_q$. Let $\mathbb{Z}$ be the set of integers, $\mathbb{Z}^+$ be the set of the positive integers, and $\mathbb{N}$ be the set of non-negative integers. For $s\in \mathbb{N}$, let $[0, s]$ denote the set $\{0, 1, 2, \cdots, s\}$. For any finite number of integers $a_1, a_2, \cdots, a_\nu$ which are not all equal to $0$, we denote their greatest common divisor by $\gcd(a_1, a_2, \cdots, a_\nu)$; for any finite number of integers $a_1, a_2, \cdots, a_\nu$, none of which is equal to $0$, denote their least common multiple by ${\rm lcm}(a_1, a_2, \cdots, a_\nu)$, where $\nu\geq 2$ is a positive integer. We use the notation $H\leq G$ to indicate that $H$ is a subgroup of $G$. For the set $S$, let $|S|$ denote the number of elements of $S$. For $a, b\in \mathbb{Z}$, we use $a|b$ to denote that $a$ divides $b$.

Let us review the definition of a constacyclic code. Let $\lambda$ be a nonzero element of $\mathbb{F}_q$, that is, $\lambda\in \mathbb{F}_q^{\times}$. Let $\phi$ be the cyclic shift, as follows:

A linear code $C$ is $\lambda$-constacyclic if $c\in C$ implies that $\phi(c)\in C$. When $\lambda = 1$, the $\lambda$-constacyclic code is the usual cyclic code. Since we may associate each codeword $(c_0, c_1, \cdots, c_{n-1})$ in $C$ with a polynomial $c_0+c_1x+\cdots+c_{n-1}x^{n-1}$ in the quotient ring $\mathbb{F}_q[x]/\langle x^n-\lambda\rangle$, a $\lambda$-constacyclic code of length $n$ over $\mathbb{F}_q$ is an ideal of the quotient ring $\mathbb{F}_q[x]/\langle x^n-\lambda\rangle$. Write $\mathcal{R} = \mathbb{F}_q[x]/\langle x^n-\lambda\rangle$. If $c = (c_0, c_1, \cdots, c_{n-1})$ is regarded as a polynomial $c(x) = c_0+c_1x+\cdots+c_{n-1}x^{n-1}$, then $\phi(c) = \phi(c(x)) = xc(x)$ in $\mathcal{R}$. Note that $\mathcal{R}$ is a principal ideal domain. Hence there is a unique monic polynomial $g(x)$ of minimum degree in the constacyclic code $C$. This polynomial generates $C$, that is, $C = \langle g(x)\rangle$, and it is called the generator polynomial for $C$ (e.g., see ^[23,24]).

In this section, we explore another approach to describe constacyclic codes, involving a different type of generating polynomial other than the generator polynomial. A polynomial $e(x)\in \mathcal{R}$ is said to be idempotent in $\mathcal{R}$ if $e^2(x) = e(x)$. Since $\gcd(n, q) = 1$, any constacyclic code $C$ is generated by an idempotent, that is, there exists an idempotent $e(x)$ in $\mathcal{R}$ such that $C = \langle e(x)\rangle = \mathcal{R}e(x)$ (see ^[23]). Two idempotents $e(x)$ and $f(x)$ are called orthogonal if $e(x)f(x) = 0$ in $\mathcal{R}$. A nonzero idempotent $e(x)$ in $\mathcal{R}$ is called primitive if it cannot be written as the sum of two nonzero orthogonal idempotents in $\mathcal{R}$.

Let $t$ be the multiplication order of $\lambda$. Then, $t|(q-1)$, which implies that $\gcd(q, t) = 1$. Noting that $\gcd(q, n) = 1$, we have that $\gcd(q, nt) = 1$. Let $m$ be the least integer such that $(nt)|(q^m-1)$ and $\mathbb{F}_{q^m}$ be the finite field with $q^m$ elements. Then, there exists a primitive $(nt)$th root $\eta$ of unity in $\mathbb{F}_{q^m}^{\times}$ such that $\lambda = \eta^n$. Thus, $x^n-\lambda = \prod\limits_{j = 0}^{n-1}(x-\eta^{1+tj})$. Let

where $0 = i_0 < i_1 < i_2 < \cdots < i_s\leq n-1$ and $k_j$ is the smallest positive integer such that $1+t\cdot i_j\equiv(1+t\cdot i_j)q^{k_j}\; (\rm{mod}\; nt)$ for $0\leq j\leq s$. Therefore, $C_0, C_1, \cdots, C_s$ are all distinct $q$-cyclotomic cosets modulo $nt$ and form a partition of the set $\{1+ti|i = 0, 1, \cdots, n-1\}$. Clearly, $|C_j| = q^{k_j}, j = 0, 1, \cdots, s$.

Now, consider the factorization

of $x^n-\lambda$ as irreducible factors over $\mathbb{F}_q$, where for $v = 0, 1, \cdots, s$,

According to the Chinese remainder theorem, we have that

For $v = 0, 1, \cdots, s$, we let $M_v(x) = \frac{x^n-\lambda}{m_v(x)}$ and $I_v = \mathbb{F}_q[x]/\langle m_v(x)\rangle$. Then,

Hence, $I_v$ is a minimal code in $\mathcal{R}$ with the generator polynomial $M_v(x)$, as well as a finite field with $q^{k_v}$ elements for $v = 0, 1, \cdots, s$.

Let $\theta_0(x), \theta_1(x), \cdots, \theta_s(x)$ be all primitive idempotents in $\mathcal{R}$ (see, for example, ^[25]). In fact, $\theta_v(x)$ is the generating idempotent of minimal code $I_v$, that is, $I_v = \langle \theta_v(x)\rangle = \mathcal{R}\theta_v(x)$. All of the primitive idempotents in $\mathcal{R}$ have the following property: For $0\leq i, j\leq s$,

Let $f(x) = \sum\limits_{i = 0}^{n-1} a_ix^i\in\mathcal{R}$, and let

where $\deg(r(x)) < k_v$ and $0\leq v\leq s$. Then since there exists a polynomial $\varphi(x)$ such that $\theta_v(x) = \varphi(x)M_v(x)$ (please see [26,Theorem 7.4.9]), we obtain that

Hence, for $v = 0, 1, \cdots, s$,

In addition, the representation of each element in $I_v$ is unique; thus $|I_v| = q^{k_v}$.

For the quotient ring $\mathbb{F}_{q^m}[x]/\langle x^n-\lambda\rangle$, there are $n$ primitive idempotents (see, for example, ^[25]):

Then, for every $u$ with $0\leq u\leq n-1$,

This shows that

In what follows, we determine the explicit formula for the primitive idempotents $\theta_v(x)'s$. Assume that $\theta_v(x) = \sum\limits_{u = 0}^{n-1}b_u x^u$. Then,

That is to say,

On the other hand, since $\theta_v(x)$ is idempotent, we have that $\theta_v^2(x) = \theta_v(x)$ in $\mathcal{R}$; thus $\theta^2_v(\eta^j) = \theta_v(\eta^j)$ for $j\geq 1$. Therefore, $\theta_v(\eta^j) = 0$ or $1$. But, according to [26, Theorem 7.4.12], $\theta_v(x)$ and $M_v(x)$ have the same zeros among the $n$-th roots of $\lambda$; thus

Therefore,

Thus, by (2.2) and (2.5), we deduce that

Hence, we can use $\theta_v(x)$ to determine all of the elements of $I_v$ in (2.1), as follows:

Therefore, we get that

where

for $v = 0, 1, \cdots, s$.

Let $C$ be a $\lambda$-constacyclic code. Then, we can write

where $J$ is a nonempty subset of $[0, s]$, and further denote the following:

3.   An enumerative formula for CCPCs

In this section, we aim to obtain a closed formula for the exact value of $|C'|$ for a given constacyclic code $C$. To this end, we explore the characterization of codewords of $C$ with full constacyclic orders.

Lemma 3.1. Let $a, b, i_v, u\in \mathbb{N}$ and $a\equiv b\; (mod\; n)$. Then, as two elements of $\mathcal{R}$ we have

Proof. Assume that $b = ns+a(s\in \mathbb{Z})$. Then,

Notice that $x^n = \lambda = \eta^n$ and $\lambda$ is an element of order $t$; we have

This proves the result. □

Lemma 3.2. Assume that $r$ is a positive integer and $v\in [0, s]$. Let

where $a_j\in \mathbb{F}_q$ for $0\leq j\leq k_v-1$. Then,

${\rm(1)}\; \phi^r(e_{(1+ti_v)q^u}(x)) = \eta^{r(1+ti_v)q^u}e_{(1+ti_v)q^u}(x)$;

${\rm(2)}\; \phi^r(a(x)) = \sum\limits_{j = 0}^{k_v-1} \sum\limits_{u = 0}^{k_v-1}a_j\eta^{(j+r)(1+ti_v)q^u}e_{(1+ti_v)q^u}(x)$;

${\rm(3)}\; \phi^r(a(x)) = a(x)$ if and only if $\frac{nt}{\gcd(n, 1+ti_v)}\big|r$.

Proof. (1) By (2.2) and Lemma 3.1, we have

This proves part (1).

(2) From (1) above, it follows that

This proves part (2).

(3) By part (2), we see that $\phi^r(a(x)) = a(x)$ if and only if $\eta^{r(1+ti_v)q^u} = 1$. Notice that $\gcd(nt, q^u) = 1$, $\gcd(t, 1+ti_v) = 1$, and $\gcd\big(\frac{nt}{\gcd(nt, 1+ti_v)}, \frac{1+ti_v}{\gcd(nt, 1+ti_v)}\big) = 1$. It follows that

This concludes the proof. □

Based on the preliminaries above, the next two results can be used to characterize the codewords with full constacyclic order for a given constacyclic code, which are discussed for the irreducible and reducible cases. These can be attributed to some number theory conditions.

Lemma 3.3. Let $v\in [0, s]$ and $C = \mathcal{R}\theta_v(x)$ be an irreducible constacyclic code generated by the primitive idempotent $\theta_v(x)$ as shown in (2.8). Then, we have the following:

$\rm(1)$ If $\gcd(n, 1+ti_v) = 1$, then every nonzero element of $C$ has full constacyclic order.

$\rm(2)$ If $\gcd(n, 1+ti_v)\neq1$, then none of the nonzero elements of $C$ has full constacyclic order.

Proof. (1) Suppose that $\gcd(n, 1+ti_v) = 1$. Let $a(x)$ be an arbitrary element in $C$ and $r_0$ be the least positive integer such that $\phi^{r_0}(a(x)) = a(x)$. Since $\phi^{nt}(a(x)) = a(x)$, we have that $r_0|(nt)$. On the other hand, by Lemma 3.2(3), we get that $(nt)|r_0$. Therefore, $r_0 = nt$, i.e., every nonzero element of $C$ has full constacyclic order.

(2) Suppose that $\gcd(n, 1+ti_v)\neq1$. Set $r'_0 = \frac{nt}{\gcd(nt, 1+ti_v)}$. Then, $r'_0 < nt$ and, by Lemma 3.2(3), it follows that $\phi^{r'_0}(a(x)) = a(x)$ for every nonzero element $a(x)$, which implies that none of the nonzero elements of $C$ has full constacyclic order. □

Lemma 3.4. Let $u\geq 2$ be an integer, and let $J = \{j_1, j_2, \cdots, j_u\}\subseteq [0, s]$ with $0\leq j_1 < j_2 < \cdots < j_u\leq s$. Let $C$ be a constacyclic code, as shown in (2.9), and $C^\sharp$ be as in (2.10). Then, we have the following:

$\rm (1)$ If $\gcd(n, 1+ti_{j_1}, 1+ti_{j_2}, \cdots, 1+ti_{j_u}) = 1$, then every nonzero element of $C^\sharp$ has full constacyclic order.

$\rm (2)$ If $\gcd(n, 1+ti_{j_1}, 1+ti_{j_2}, \cdots, 1+ti_{j_u})\neq1$, then none of the nonzero elements of $C^\sharp$ has full constacyclic order.

Proof. Let $a(x) = a_1(x)+a_2(x)+\cdots+a_u(x)$ be an arbitrary element in $C^\sharp$, where $a_\ell(x)\in \mathcal{R}\theta_{j_\ell}(x)$ for $\ell = 0, 1, \cdots, u$, and $s_0$ be the least positive integer such that $\phi^{s_0}(a(x)) = a(x)$. Since $\phi^{nt}(a(x)) = a(x)$, we have that $s_0|(nt)$. On the other hand, we see that $\phi^{s_0}(a(x)) = a(x)$ if and only if $\phi^{s_0}(a_\ell(x)) = a_\ell(x)$ for $\ell = 0, 1, \cdots, u$. By Lemma 3.2(3), we get that $\phi^{s_0}(a_\ell(x)) = a_\ell(x)$ for $\ell = 0, 1, \cdots, u$ if and only if

for $\ell = 0, 1, \cdots, u$. Further, $\frac{nt}{\gcd(nt, 1+ti_{j_\ell})}\Big|s_0$ for $\ell = 0, 1, \cdots, u$ if and only if

By induction on $u$, we can easily prove the equality, as follows:

Therefore, $\frac{nt}{\gcd(nt, 1+ti_{j_\ell})}\Big|s_0$ for $\ell = 0, 1, \cdots, u$ if and only if

(1) Suppose that $\gcd(n, 1+ti_{j_1}, 1+ti_{j_2}, \cdots, 1+ti_{j_u}) = 1$. Then, we get $(nt)|s_0$. Hence, $s_0 = nt$. Therefore, every nonzero element of $C^\sharp$ has full constacyclic order.

(2) Suppose that $\gcd(n, 1+ti_{j_1}, 1+ti_{j_2}, \cdots, 1+ti_{j_u})\neq1$. Set

Then, $s'_0 < nt$. According to the above proof, we can see that $\phi^r(a(x)) = a(x)$ for $a(x)\in C^\sharp$ if and only if

So $\phi^{s'_0}(a(x)) = a(x)$. Since $s'_0 < nt$, $a(x)$ has no full constacyclic order. $a(x)$ is arbitrary, implying that none of the nonzero elements of $C^\sharp$ has full constacyclic order. □

Let $C$ be a constacyclic code, as shown in (2.9) with $J = \{j_1, j_2, \cdots, j_u\}\subseteq [0, s]$, where $0\leq j_1 < j_2 < \cdots < j_u\leq s$. That is,

Then,

For $1\leq v \leq u$, let

For $\{j_{\ell_1}, j_{\ell_2}, \cdots, j_{\ell_v}\}\in \Theta_v$, set

Thus according to the characterization conditions above about the codewords with full constacyclic order, the following result is easily obtained, which determines the exact value of $|C'|$ for a given arbitrary constacyclic code $C$.

Theorem 3.5. Let the notation be as above. Let $C$ be a constacyclic code, as shown in (3.1). Then, the following holds:

$\rm (1)$ The elements of $C$ with full constacyclic order are given by

$\rm (2)$ $|C'|$ is given as follows:

Proof. (1) It follows from Lemmas 3.3 and 3.4.

(2) According to the definition of $C'$, and based on the result of (1), we have

Since

we obtain the desired result.

4.   Generation of CCPCs

In this section, we delve more deeply into the structure of CCPCs, paying particular attention to the elements of $C'$ for a given constacyclic code $C$. First, we describe the observation. Recall that, for $v\in [0, s]$ the irreducible code $\mathcal{R}\theta_v(x)$ is given by

Notice the following fact about the element of $\mathcal{R}\theta_v(x)$:

And, when $a_j$ runs through $\mathbb{F}_q$, $\sum_{j = 0}^{k_v-1}a_j\eta^{j(1+ti_v)}$ just runs through finite field $\mathbb{F}_{q^{k_v}}$. Then, $\mathcal{R}\theta_v(x)$ can be expressed, as follows:

For every $v\in [0, s]$, $\mathcal{R}\theta_v(x) = \mathbb{F}_{q^{k_v}}$ is a finite field; we can denote its primitive element by $\gamma_v$, which generates the cyclic group $\mathbb{F}^{\times}_{q^{k_v}} = \mathbb{F}_{q^{k_v}}\backslash\{0\}$. If $\gcd(n, 1+ti_v) = 1$, then there is the decomposition of the left cosets of $\langle \eta^{1+ti_v}\rangle = \langle \eta\rangle$ in $\mathbb{F}^{\times}_{q^{k_v}} = \mathbb{F}_{q^{k_v}}\backslash\{0\}$, as follows:

We first consider irreducible constacyclic codes.

Theorem 4.1. Let $C = \mathcal{R}\theta_v(x)$ be an irreducible constacyclic code over $\mathbb{F}_q$, where $v\in [0, s]$. Suppose that $\gcd(n, 1+ti_v) = 1$, and keep the notation as in (4.2). Then,

is a CCPC of size $\frac{q^{k_v}-1}{nt}$.

Proof. By Lemma 3.3, every nonzero element of $C$ has full constacyclic order. Suppose that

where $\omega_1, \omega_2\in \mathbb{F}_{q^{k_v}}$. If there exists $r$ such that $\phi^r(a(x)) = b(x)$, then, by Lemma 3.2(2), we see that

Therefore, $\phi^r(a(x)) = b(x)$ if and only if $\eta^{r(1+ti_v)}\omega_1 = \omega_2$, which implies that $\omega_1$ and $\omega_2$ make up the same left coset of $\langle \eta^{1+ti_v}\rangle = \langle \eta\rangle$ in $\mathbb{F}^{\times}_{q^{k_v}} = \mathbb{F}_{q^{k_v}}\backslash\{0\}$. Therefore, according to (4.2), we obtain the desired result. □

In what follows, we consider the case when $C$ is a reducible constacyclic code. Let $C$ be as in (3.1), where $u\geq2$. For simplicity, we write

We set

Then $G_3\leq G_2\leq G_1$.

Suppose that $\gamma_{\alpha_\kappa}$ is the primitive element of the finite field $\mathbb{F}_{q^{k_{\alpha_\kappa}}} = \mathbb{F}_{q^{k_{j_{\ell_\kappa}}}}$, that is to say, $\mathbb{F}^{\times}_{q^{k_{\alpha_\kappa}}} = \langle\gamma_{\alpha_\kappa}\rangle$ for $\kappa = 1, 2, \cdots, v$.

Our goal now is to construct a coset decomposition of $G_3$ in $G_1$. First, for $\kappa = 1, 2, \cdots, v$,

Then, there exists a coset decomposition of the subgroup $G_2$ in $G_1$:

Next, the routine check shows that there is a coset decomposition of the subgroup $G_3$ in $G_2$:

where $\sigma_1 = 1$.

Therefore, the coset decomposition of the subgroup $G_3$ in $G_1$ is given as follows:

We are now in a position to determine a CCPC from a given constacyclic code.

Theorem 4.2. Apply the notation as above. Let $C$ be a constacyclic code with the decomposition of the form as in (3.1). Then,

is a CCPC of size

where $\Theta_v$ is as shown in (3.3).

Proof. Let $\{j_{\ell_1}, j_{\ell_2}, \cdots, j_{\ell_v}\}\in \Theta_v$, where $1\leq v\leq u$. Now, we only need to consider the following subcode:

Note that, for $1\leq\epsilon \leq v$,

Assume that

where

Then, for any $r\in \mathbb{Z}^+$, $\phi^r(f(x)) = g(x)$ if and only if

which holds if and only if

which shows that both $\sum_{\epsilon = 1}^v\omega_{1\epsilon}$ and $\sum_{\epsilon = 1}^v\omega_{2\epsilon}$ are in the same coset of

in the group

By virtue of the result shown in (4.4), we immediately obtain this theorem. □

At the end of this section, we present an example to illustrate our main results.

Example 4.3. Let $q = 5, n = 18$, and $\lambda = 4$. All $5$-cyclotomic cosets are as follows:

Then, $t = 2$ and

Assume that five constacyclic codes $\mathcal{C}_1, \mathcal{C}_2, \mathcal{C}_3, \mathcal{C}_4, \mathcal{C}_5$ are as follows:

Set $\mathbb{F}_{5^2}^{\times} = \langle \gamma_1\rangle$ and $\mathbb{F}_{5^6}^{\times} = \langle \gamma_2\rangle$. Then, we have the following:

(1) According to Lemma 3.3, since $\gcd(n, 1+ti_1) = \gcd(18, 3) = 3\neq 1$, none of the nonzero elements of $\mathcal{C}_1$ has full constacyclic order.

(2) According to Lemma 3.3, the fact that $\gcd(n, 1+ti_2) = \gcd(18, 7) = 1$ shows that every nonzero element of $\mathcal{C}_2$ has full constacyclic order; thus

By using Theorem 4.1, we get that

(3) According to Lemmas 3.3 and 3.4, since

none of the nonzero elements of $\mathcal{C}_3$ has full constacyclic order.

(4) Since

then,

By Theorem 3.5, we get that

In addition,

By Theorem 4.2, we have that

Here, from the formula of $\mathcal{C}'_4$, we can also get that

which is the same as the above result provided by Theorem 3.5.

(5) Since

then

By Theorem 3.5, we get that

In addition,

By Theorem 4.2, we have that

Here, from the formula of $\mathcal{C}'_5$, we can also get that

which is the same as the above result provided by Theorem 3.5.

5.   Conclusions

In this paper, we have introduced the definition of CCPCs and mainly focused on the construction of such a class of codes. First, we proposed a new and explicit enumerative formula for the code size of such CCPCs. Next, we provided an effective method to obtain such a CCPC by using an algebraic tool. A possible direction for future work is to consider the problem of constructing CCPCs with the largest possible code size from a given repeated-root constacyclic code.

Use of AI tools declaration

The authors declare that they have not used Artificial Intelligence (AI) tools in the creation of this article.

Acknowledgments

We sincerely thank the Associate Editor and the anonymous referees for their carefully reading and helpful suggestions that led to the improvement of the paper.

G. Zhang was supported by the Guiding Science and Technology Plan Project of Suqian City in 2023.

Conflict of interest

The authors declare no conflicts of interest.