Loading [MathJax]/extensions/TeX/mathchoice.js
Research article Special Issues

A decision-making strategy to combat CO2 emissions using sine trigonometric aggregation operators with cubic bipolar fuzzy input

  • Received: 26 February 2023 Revised: 26 March 2023 Accepted: 11 April 2023 Published: 23 April 2023
  • MSC : 03E72, 94D05, 90B50

  • A cubic bipolar fuzzy set (CBFS) is by far the most efficient model for handling bipolar fuzziness because it carries both single-valued (SV) and interval-valued (Ⅳ) bipolar fuzzy numbers at the same time. The sine trigonometric function possesses two consequential qualities, namely, periodicity and symmetry, both of which are helpful tools for matching decision makers' conjectures. This article aims to integrate the sine function and cubic bipolar fuzzy data. As a result, sine trigonometric operational laws (STOLs) for cubic bipolar fuzzy numbers (CBFNs) are defined in this article. Premised on these laws, a substantial range of aggregation operators (AOs) are introduced. Certain features of these operators, including monotonicity, idempotency, and boundedness, are explored as well. Using the proffered AOs, a novel multi-criteria group decision-making (MCGDM) strategy is developed. An extensive case study of carbon capture and storage (CCS) technology has been provided to show the viability of the suggested method. A numerical example is provided to manifest the feasibility of the developed approach. Finally, a comparison study is executed to discuss the efficacy of the novel MCGDM framework.

    Citation: Anam Habib, Zareen A. Khan, Nimra Jamil, Muhammad Riaz. A decision-making strategy to combat CO2 emissions using sine trigonometric aggregation operators with cubic bipolar fuzzy input[J]. AIMS Mathematics, 2023, 8(7): 15092-15128. doi: 10.3934/math.2023771

    Related Papers:

    [1] Yijia Zhang, Tao Xie, Yunlong Ma . Robustness analysis of exponential stability of Cohen-Grossberg neural network with neutral terms. AIMS Mathematics, 2025, 10(3): 4938-4954. doi: 10.3934/math.2025226
    [2] R. Sriraman, R. Samidurai, V. C. Amritha, G. Rachakit, Prasanalakshmi Balaji . System decomposition-based stability criteria for Takagi-Sugeno fuzzy uncertain stochastic delayed neural networks in quaternion field. AIMS Mathematics, 2023, 8(5): 11589-11616. doi: 10.3934/math.2023587
    [3] Jingyang Ran, Tiecheng Zhang . Fixed-time synchronization control of fuzzy inertial neural networks with mismatched parameters and structures. AIMS Mathematics, 2024, 9(11): 31721-31739. doi: 10.3934/math.20241525
    [4] Wenxiang Fang, Tao Xie, Biwen Li . Robustness analysis of fuzzy BAM cellular neural network with time-varying delays and stochastic disturbances. AIMS Mathematics, 2023, 8(4): 9365-9384. doi: 10.3934/math.2023471
    [5] Wenxiang Fang, Tao Xie . Robustness analysis of stability of Takagi-Sugeno type fuzzy neural network. AIMS Mathematics, 2023, 8(12): 31118-31140. doi: 10.3934/math.20231593
    [6] Tao Xie, Wenqing Zheng . Robustness analysis of Cohen-Grossberg neural network with piecewise constant argument and stochastic disturbances. AIMS Mathematics, 2024, 9(2): 3097-3125. doi: 10.3934/math.2024151
    [7] Tiecheng Zhang, Wei He . Global robust stability of fuzzy cellular neural networks with parameter uncertainties. AIMS Mathematics, 2024, 9(4): 8063-8078. doi: 10.3934/math.2024392
    [8] Ankit Kumar, Subir Das, Vijay K. Yadav, Rajeev, Jinde Cao, Chuangxia Huang . Synchronizations of fuzzy cellular neural networks with proportional time-delay. AIMS Mathematics, 2021, 6(10): 10620-10641. doi: 10.3934/math.2021617
    [9] Chengqiang Wang, Xiangqing Zhao, Yang Wang . Finite-time stochastic synchronization of fuzzy bi-directional associative memory neural networks with Markovian switching and mixed time delays via intermittent quantized control. AIMS Mathematics, 2023, 8(2): 4098-4125. doi: 10.3934/math.2023204
    [10] Shuo Ma, Jiangman Li, Qiang Li, Ruonan Liu . Adaptive exponential synchronization of impulsive coupled neutral stochastic neural networks with Lévy noise and probabilistic delays under non-Lipschitz conditions. AIMS Mathematics, 2024, 9(9): 24912-24933. doi: 10.3934/math.20241214
  • A cubic bipolar fuzzy set (CBFS) is by far the most efficient model for handling bipolar fuzziness because it carries both single-valued (SV) and interval-valued (Ⅳ) bipolar fuzzy numbers at the same time. The sine trigonometric function possesses two consequential qualities, namely, periodicity and symmetry, both of which are helpful tools for matching decision makers' conjectures. This article aims to integrate the sine function and cubic bipolar fuzzy data. As a result, sine trigonometric operational laws (STOLs) for cubic bipolar fuzzy numbers (CBFNs) are defined in this article. Premised on these laws, a substantial range of aggregation operators (AOs) are introduced. Certain features of these operators, including monotonicity, idempotency, and boundedness, are explored as well. Using the proffered AOs, a novel multi-criteria group decision-making (MCGDM) strategy is developed. An extensive case study of carbon capture and storage (CCS) technology has been provided to show the viability of the suggested method. A numerical example is provided to manifest the feasibility of the developed approach. Finally, a comparison study is executed to discuss the efficacy of the novel MCGDM framework.



    As a generalization of cyclic codes and negacyclic codes, constacyclic codes were first introduced by Berlekamp in 1968 [3]. Given a nonzero element λ in a finite filed Fq, a linear code C of length n over Fq is called λ-constacyclic if (λcn1,c0,,cn2)C for every (c0,c1,,cn1)C. Constacyclic codes over finite fields form a remarkable class of linear codes, as it includes the class of cyclic codes and the class of negacyclic codes as proper subclasses. Constacyclic codes have rich algebraic structure so that they can be efficiently encoded and decoded by means of shift registers. Repeated-root constacyclic codes were a special class of constacyclic codes. Repeated-root constacyclic codes were first studied by Castagnoli et al. [4] and van Lint [13], and they showed that repeated-root cyclic codes have a concatenated construction and are not asymptotically good.

    Recently, repeated-root constacyclic codes have been studied by many authors. To determine the generator polynomials of all constacyclic codes of arbitrary length over finite fields is an important problem. Dinh studied repeated-root constacyclic codes of lengths 2ps, 3ps, 4ps and 6ps in a series of papers [8,9,10,11]. He determined the algebraic structure of these repeated-root constacyclic codes over finite fields in terms of their generator polynomials. In [7], Chen et al. introduced an equivalence relation called isometry for the nonzero elements of Fq to classify constacyclic codes of length n over Fq. They have the same distance structures and the same algebraic structures for belonging to the same equivalence classes induced by isometry. Furthermore, in [5], Chen et al. considered a more specified relationship than isometry that enabled us to obtain more explicit description of generator polynomials of all constacyclic codes. According to the equivalence classes, all constacyclic codes of length ps over Fqm and their dual are characterized, where is a prime different from p and s is a positive integer. In 2012, Bakshi and Raka [1] also determined all Λ-constacyclic codes of length 2tps(t1,s0 are integers) over Fpr using different methods from Chen et al.. In 2015, Chen et al. [6] determined the algebraic structure of all constacyclic codes of length 2mps over Fpr and their dual codes in terms of their generator polynomials, where ,p are distinct odd primes and s,m are positive integers. In the conclusion of the paper [6], they proposed an open problem to study all constacyclic codes of length kmps over Fq, where p is the characteristic of Fq, is an odd prime different from p, and k is a prime different from and p. Batoul et al. [2] investigated the structure of constacyclic codes of length 2ampr over Fps with a1 and (m,p)=1. They also provided certain sufficient conditions under which these codes are equivalent to cyclic codes of length 2ampr over Fps. Sharma [16] determined all constacyclic codes of length tps over Fpr and their dual codes, where ,p are distinct primes, is odd and s,t,r are positive integers. In 2016, Sharma et al. [17] determine generator polynomials of all constacyclic codes of length 4mpn over the finite field Fq and their dual codes, where p, are distinct odd primes, q is a power of p and m,n are positive integers. Working in the same direction, Liu et al. obtained generator polynomials of all repeated-root constacyclic codes of length 3ps over Fq in [14], where is an odd prime different from p and 3. In 2017, Liu et al. [15] explicitly determine the generator polynomials of all repeated-root constacyclic codes of length nps over Fq and their dual codes, where is an odd prime different from p, and n is an odd prime different from both and p such that n=2h+1 for some prime h. In 2019, Wu and Yue et al. [19,20] explicitly factorize the polynomial xnλ for each λFq. As applications, they obtain all repeated-root λ-constacyclic codes and their dual codes of length nps over Fq.

    In this paper, we answer the question of B. Chen, H. Dinh and Liu. That is we determine all the constacyclic codes of length p1pt2ps over Fq, where p is the characteristic of Fq, p1 is an odd prime different from p, and p1 is a prime different from p2 and p. We give the explicit generator polynomials of all the constacyclic codes of length p1pt2ps over Fq and their dual codes, and determine all self-dual cyclic codes of length p1pt2ps and their enumeration.

    The remainder of this paper is organized as follows. In Section 2 we give a brief background on some basic results which we need in the following parts. In Section 3, we calculate the q-cyclotomic cosets modulo p1pt2 as a preparation for giving the generator polynomials of constacyclic codes of length p1pt2ps over Fq. In Section 4, we first describe a general method to obtain the generator polynomials of constacyclic codes, and then with this method and the results of q-cyclotomic cosets modulo p1pt2 we give the explicit generator polynomials of all the constacyclic codes of length p1pt2ps. And in Section 5, all the self-dual cyclic codes of length p1pt2ps over Fq are given. In the last section, as an example we calculate the case of length 5ps, where is a prime different from 5 and p.

    In this section, we first review some basic results in number theory and finite fields, which we will in the following parts, and then give a brief introduction to the λ-constacyclic codes. For a positive integer n, we denote by Zn the ring of integers module n throughout this paper. Let p be a prime number, and q be a power of p. We denote by Fq the finite field with q elements, and fix a generator element ξ of the multiplicative group Fq, that is, Fq=ξ. In this paper, we mainly deal with the repeated-root constacyclic codes of length p1pt2ps over Fq, where p1 and p2 are two distinct odd prime numbers different from p. For any positive integer d and i=1,2, we write fi,d=ordpdi(q) for the multiplicative order of q modulo pdi, and set gi,d=ϕ(pdi)fi,d, where ϕ is the Euler's phi function. When d=1, we write fi=fi,1 and gi=gi,1 for simplicity. For i=1,2, there are positive integers ui and wi such that qfi=1+puiiwi and piwi. Following the lifting-the-exponent lemma, we immediately have

    fi,d=fipmax{0,dui}i.

    Lemma 2.1. [12] Assume that r is a primitive root of the odd prime p and (r+tp)p1 is not congruent to 1 modulo p2. Then r+tp is a primitive root of pk for each k1.

    Lemma 2.2. [18] Let n2 be an integer, and λ be a nonzero element in Fq with multiplicative order k=ord(λ). The binomial xnλ is irreducible over Fq if and only if

    (1) Every prime divisor of n divides k, but not q1k;

    (2) If 4n, then 4(q1).

    Let λ be a nonzero element in Fq. A λ-constacyclic code of length n is a linear code C such that (c0,c1,,cn1)C implies (λcn1,c0,,cn2)C. This definition is a natural generalization of cyclic code and negacyclic code. A λ-constacyclic code C of length n over Fq can be regarded as an ideal (g(x)) of the quotient ring Fq[x]/(xnλ), where g(x) is a divisor of xnλ. Let C be a λ-constacyclic code of length n over Fq, then the dual code of code C is given by C={xFnq:xy=0,yC}, where xy denotes the Euclidean inner product of x and y. If C is generated by a polynomial g(x) satisfying g(x)xnλ, and h(x) is given by h(x)=xnλg(x), then h(x) is called the parity check polynomial of code C. It is a classical result that the dual code C is generated by h(x), where h(x)=h(0)1xdeg(h(x))h(x1) is the reciprocal polynomial of h(x). The code C is called to be a self-orthogonal if CC and a self-dual code if C=C. For self-dual cyclic code, a well-known result states that there exist self-dual cyclic codes of length n over Fq if and only if n is even and the characteristic of Fq is p=2.

    There are q1 classes of constacyclic codes of length n over Fq. However, some of them are turned out to be equivalent in the sense that they have the same structure. To be explicit, two elements λ,μFq are called n-equivalent in Fqif there exists aFq such that anλ=μ.

    Lemma 2.3. [5] For any λ,μFq, the following four statements are equivalent:

    (1) λ and μ are n-equivalent in Fq.

    (2) λ1μξn.

    (3) (λ1μ)d=1, where d=q1gcd(n,q1).

    (4) There exists an aFq such that

    φa:Fq[X]/(Xnμ)Fq[X]/(Xnλ);f(X)f(aX)

    is an Fq-algebra isomorphism. In particular, there are gcd(n,q1) n-equivalence classes in Fq.

    We conclude this section with the introduction of q-cyclotomic coset which is important in the computation of constacyclic codes. Let n be a positive integer relatively prime to n. For 0sn1, the q-cyclotomic coset of s modulo n is defined to be

    Cs={s,sq,,sqns1},

    where ns is the least positive integer such that sq^{n_{s}}\equiv s \pmod n . It is obvious to see that n_{s} is equal to the multiplicative order of q modulo \frac{n}{\gcd(s, n)} . Notice that if sq^{a} \equiv s^{\prime}q^{b} \pmod n for some positive integers a, b , then

    s \equiv sq^{a+(n_{s}-a)} \equiv s^{\prime}q^{b+(n_{s}-a)} \pmod n.

    It follows that for 0 \leq s, s^{\prime} \leq n-1 , C_{s} \cap C_{s^{\prime}} \neq \emptyset if and only if C_{s} = C_{s^{\prime}} . Therefore the q -cyclotomic cosets give a classification of the element in \mathbb{Z}_{n} .

    If \alpha is a primitive n th root of unit in some extension field of \mathbb{F}_q , then the polynomial

    C_{s}(x) = \prod\limits_{i\in C_{s}}(x-\alpha^{i})

    is exactly the minimal polynomial of \alpha^{s} over \mathbb{F}_q , and

    x^{n}-1 = \prod\limits_{s} C_{s}(x)

    gives the irreducible factorization of x^{n}-1 over \mathbb{F}_q , where s runs over all representations of distinct q -cyclotomic cosets modulo n . We call C_{s}(x) the polynomial associated to C_{s} .

    Let C_{s} = \{s, sq, \cdots, sq^{n_{s}-1}\} be any q -cyclotomic coset modulo n . The reciprocal coset of C_{s} is defined to be

    C_{s}^{*} = \{-s, -sq, \cdots, -sq^{n_{s}-1}\}.

    We say that the coset C_{s} is self-reciprocal if C_{s} = C_{s}^{*} . One can check that the polynomial C_{s}^{*}(x) associated to the reciprocal coset C_{s}^{*} is exactly the reciprocal polynomial of C_{s}(x) .

    The q -cyclotomic cosets modulo p_{1}p_{2}^{t} plays an important role in determining all the constacyclic codes of length p_{1}p_{2}^{t}p^{s} . In this section we consider a more general case that classifies all the q -cyclotomic cosets modulo p_{1}^{t_{1}}p_{2}^{t_{2}} , where p_{1} and p_{2} are two distinct odd prime numbers not dividing q , and t_{1}, t_{2} are positive integers.

    Let \ell be a prime number not dividing q , and \mu be a generator of the cyclic group \mathbb{Z}_{\ell}^{*} . It is obvious that all the q -cyclotomic cosets modulo \ell are given by C_{0} = \{0\} and

    C_{k} = \{\mu^{k}, \mu^{k}q, \cdots, \mu^{k}q^{\mathrm{ord}_{\ell}(q)-1}\}, \ 1\leq k\leq \dfrac{\ell - 1}{\mathrm{ord}_{\ell}(q)}.

    For different odd prime numbers p_{1} and p_{2} , we claim that there exists an integer \mu_{1} satisfying that:

    (1) \mu_{1} is a primitive root modulo p_{1}^{d} for all d\geq 1 ; and

    (2) \mu_{1}\equiv 1 \pmod {p_{2}} .

    We begin with a random primitive root \eta_{1}^{'} modulo p_{1} . If p_{1}^{2}\nmid {\eta_{1}^{'}}^{p_{1}-1}-1 , we let \eta_{1} = \eta_{1}^{'} , otherwise we let \eta_{1} = \eta_{1}^{'}+p_{1} . It is trivial to see that \eta_{1} satisfies the condition \gcd(\frac{\eta_{1}^{p_{1}-1}-1}{p_{1}}, p_{1}) = 1 . Let \mu_{1} = \eta_{1}+(1-\eta_{1})p_{1}^{p_{2}-1} , then

    \mu_{1}^{p_{1}-1}-1\equiv (\eta_{1}+(1-\eta_{1})p_{1}^{p_{2}-1})^{p_{1}-1}-1\equiv \eta_{1}^{p_{1}-1}-1 \pmod {p_1^2}.

    It follows that

    \gcd(\frac{\mu_{1}^{p_{1}-1}-1}{p_{1}}, p_{1}) = \gcd(\frac{\eta_{1}^{p_{1}-1}-1}{p_{1}}, p_{1}) = 1.

    Following Lemma 2.1, \mu_{1} is a primitive root modulo p_{1}^{d} for all d\geq 1 such that \mu_{1}\equiv 1 \pmod {p_{2}} . By the symmetric argument, we can find an integer \mu_{2} satisfying that

    (1) \mu_{2} is a primitive root modulo p_{2}^{d} for all d\geq 1 ; and

    (2) \mu_{2}\equiv 1 \pmod {p_{1}} .

    We fix such a pair of integers \mu_{1} and \mu_{2} .

    Theorem 3.1. Let p_{1} and p_{2} be two different odd prime numbers not dividing q , and t_{1} and t_{2} be positive integers. Then all the distinct q -cyclotomic cosets module p_{1}^{t_{1}}p_{2}^{t_{2}} are given by

    C_{\mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{1}^{r_{1}}p_{2}^{r_{2}}} = \{\mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{1}^{r_{1}}p_{2}^{r_{2}}, \mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{1}^{r_{1}}p_{2}^{r_{2}}q, \cdots, \mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{1}^{r_{1}}p_{2}^{r_{2}}q^{c_{r_{1}, r_{2}}}\}

    for 0 \leq r_{1} \leq t_{1} , 0\leq r_{2} \leq t_{2} , 0 \leq k_{1} \leq g_{1, t_{1}-r_{1}} - 1 and 0 \leq k_{2} \leq g_{2, t_{2}-r_{2}}\cdot \gcd(f_{1, t_{1}-r_{1}}, f_{2, t_{2}-r_{2}}) - 1 , where c_{r_{1}, r_{2}} = \mathrm{ord}_{p_{1}^{t_{1}-r_{1}}p_{2}^{t_{2}-r_{2}}}(q) = \mathrm{lcm}(f_{1, t_{1}-r_{1}}, f_{2, t_{2}-r_{2}}) .

    Proof. First we prove that the given q -cyclotomic cosets are all distinct. If C_{\mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{1}^{r_{1}}p_{2}^{r_{2}}} = C_{\mu_{1}^{k_{1}^{\prime}}\mu_{2}^{k_{2}^{\prime}}p_{1}^{r_{1}^{\prime}}p_{2}^{r_{2}^{\prime}}} for some 0 \leq r_{1}, r_{1}^{\prime} \leq t_{1} , 0\leq r_{2}, r_{2}^{\prime} \leq t_{2} , 0 \leq k_{1}, k_{1}^{\prime} \leq g_{1, t_{1}-r_{1}} - 1 and 0 \leq k_{2}, k_{2}^{\prime} \leq g_{2, t_{2}-r_{2}}\cdot \gcd(f_{1, t_{1}-r_{1}}, f_{2, t_{2}-r_{2}})-1 , then there exists a positive integer m such that

    \begin{equation} \mu_{1}^{k_{1}^{\prime}}\mu_{2}^{k_{2}^{\prime}}p_{1}^{r_{1}^{\prime}}p_{2}^{r_{2}^{\prime}} \equiv \mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{1}^{r_{1}}p_{2}^{r_{2}}q^{m} \pmod{p_{1}^{t_{1}}p_{2}^{t_{2}}}. \end{equation} (3.1)

    Since \mu_{1}, \mu_{2} and q are relatively prime to p_{1}^{t_{1}}p_{2}^{t_{2}} , clearly we have r_{1} = r_{1}^{\prime} and r_{2} = r_{2}^{\prime} , and Eq (3.1) can be reduced to

    \mu_{1}^{k_{1}^{\prime}}\mu_{2}^{k_{2}^{\prime}} \equiv \mu_{1}^{k_{1}}\mu_{2}^{k_{2}}q^{m} \pmod{p_{1}^{t_{1}-r_{1}}p_{2}^{t_{2}-r_{2}}}.

    Remembering that \mu_{1} \equiv 1 \pmod{p_{2}} and \mu_{2} \equiv 1 \pmod{p_{1}} , then by the Chinese remainder theorem, we have

    \begin{equation} \mu_{1}^{k_{1}-k_{1}^{\prime}} \equiv q^{m} \pmod{p_{1}^{t_{1}-r_{1}}} \end{equation} (3.2)
    \begin{equation} \mu_{2}^{k_{2}-k_{2}^{\prime}} \equiv q^{m} \pmod{p_{2}^{t_{2}-r_{2}}} \end{equation} (3.3)

    Equation (3.2) implies that

    \mu_{1}^{(k_{1}-k_{1}^{\prime})f_{1, t_{1}-r_{1}}} \equiv q^{m\cdot f_{1, t_{1}-r_{1}}} \equiv 1 \pmod{p_{1}^{t_{1}-r_{1}}},

    and therefore \phi(p_{1}^{t_{1}-r_{1}}) \mid (k_{1}-k_{1}^{\prime})f_{1, t_{1}-r_{1}} . Since 0 \leq k_{1}, k_{1}^{\prime} \leq g_{1, t_{1}-r_{1}} - 1 , one must have k_{1} = k_{1}^{\prime} . Notice that k_{1} = k_{1}^{\prime} indicates that q^{m} \equiv 1 \pmod{p_{1}^{t_{1}-r_{1}}} , then f_{1, t_{1}-r_{1}} \mid m , which together with Eq (3.3) leads to

    \mu_{2}^{(k_{2}^{\prime}-k_{2})\cdot \dfrac{f_{2, t_{2}-r_{2}}}{\gcd(f_{1, t_{1}-r_{1}}, f_{2, t_{2}-r_{2}})}} \equiv q^{m \cdot \dfrac{f_{2, t_{2}-r_{2}}}{\gcd(f_{1, t_{1}-r_{1}}, f_{2, t_{2}-r_{2}})}} \equiv 1 \pmod{p_{2}^{t_{2}-r_{2}}}.

    Thus \phi(p_{2}^{t_{2}-r_{2}}) \mid (k_{2}^{\prime}-k_{2})\cdot \dfrac{f_{2, t_{2}-r_{2}}}{\gcd(f_{1, t_{1}-r_{1}}, f_{2, t_{2}-r_{2}})} . Since 0 \leq k_{2}, k_{2}^{\prime} \leq g_{2, t_{2}-r_{2}}\cdot \gcd(f_{1, t_{1}-r_{1}}, f_{2, t_{2}-r_{2}}) - 1 , we have k_{2} = k_{2}^{\prime} .

    On the other hand, there are in total

    \begin{equation} \begin{aligned} &\sum\limits_{0 \leq r_{1} \leq t_{1}} \sum\limits_{0 \leq r_{2} \leq t_{2}} \dfrac{\phi(p_{1}^{t_{1}-r_{1}})}{f_{1, t_{1}-r_{1}}}\cdot \dfrac{\phi(p_{2}^{t_{2}-r_{2}})}{f_{2, t_{2}-r_{2}}} \cdot \gcd(f_{1, t_{1}-r_{1}}, f_{2, t_{2}-r_{2}})\cdot \mathrm{lcm}(f_{1, t_{1}-r_{1}}, f_{2, t_{2}-r_{2}}) \\ & = \sum\limits_{0 \leq r_{1} \leq t_{1}} \sum\limits_{0 \leq r_{2} \leq t_{2}}\phi(p_{1}^{t_{1}-r_{1}})\phi(p_{2}^{t_{2}-r_{2}}) = p_{1}^{t_{1}}p_{2}^{t_{2}} \end{aligned} \end{equation} (3.4)

    elements in these q -cyclotomic cosets, therefore they are all the distinct q -cyclotomic cosets module p_{1}^{t_{1}}p_{2}^{t_{2}} .

    In particular, when t_{1} = 1 and t_{2} = t , the classification of the q -cyclotomic cosets modulo p_{1}p_{2}^{t} is given as follow.

    Corollary 3.1. Let the notations be as above. Then all the distinct q -cyclotomic cosets modulo p_{1}p_{2}^{t} are

    C_{0} = \{0\};
    C_{\mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{2}^{r}} = \{\mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{2}^{r}, \mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{2}^{r}q, \cdots, \mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{2}^{r}q^{\mathrm{ord}_{p_{1}p_{2}^{t-r}}(q)-1}\}

    for 0 \leq r \leq t-1 , 0\leq k_{1}\leq g_{1} -1 and 0 \leq k_{2} \leq g_{2, t-r} \cdot \gcd(f_{1}, f_{2, t-r}) ;

    C_{\mu_{1}^{k}p_{2}^{t}} = \{\mu_{1}^{k}p_{2}^{t}, \mu_{1}^{k}p_{2}^{t}q, \cdots, \mu_{1}^{k}p_{2}^{t}q^{f_{1}-1}\}

    for 0\leq k\leq g_{1}-1 ; and

    C_{\mu_{2}^{k^{\prime}}p_{1}p_{2}^{r}} = \{\mu_{2}^{k^{\prime}}p_{1}p_{2}^{r}, \mu_{2}^{k^{\prime}}p_{1}p_{2}^{r}q, \cdots, \mu_{2}^{k^{\prime}}p_{1}p_{2}^{r}q^{f_{2, t-r}-1}\}

    for 0\leq r \leq t-1 and 0\leq k^{\prime} \leq g_{2, t-r}-1 .

    Corollary 3.2. Let the notations be as aboved. Then the irreducible factorization of x^{p_{1}p_{2}^{t}p^{s}}-1 over \mathbb{F}_q is given by

    x^{p_{1}p_{2}^{t}p^{s}}-1 = C_{0}(x)^{p^{s}}\prod\limits_{r = 0}^{t-1}\prod\limits_{k_{1} = 0}^{g_{1}-1}\prod\limits_{k_{2} = 0}^{g_{2, t-r}\gcd(f_{1}, f_{2, t-r})-1} C_{\mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{2}^{r}}(x)^{p^{s}}\prod\limits_{k = 0}^{g_{1}-1} C_{\mu_{1}^{k}p_{2}^{t}}(x)^{p^{s}}\prod\limits_{r = 0}^{t-1}\prod\limits_{k^{\prime} = 0}^{g_{2, t-r}-1} C_{\mu_{2}^{k^{\prime}}p_{1}p_{2}^{r}}(x)^{p^{s}}.

    In this section, we will determine the generator polynomials of all constacyclic codes of length p_{1}p_{2}^{t}p^{s} over \mathbb{F}_q and their dual codes. For \lambda \in \mathbb{F}_{q}^{*} , we identify a \lambda -constacyclic code of length p_{1}p_{2}^{t}p^{s} with an ideal (g(x)) of the quotient ring \mathbb{F}_q[x]/(x^{p_{1}p_{2}^{t}p^{s}}-\lambda) , where g(x) is a divisor of x^{p_{1}p_{2}^{t}p^{s}}-\lambda . By Lemma 2.3, there are \gcd(p_{1}p_{2}^{t}, q-1) p_{1}p_{2}^{t}p^{s} -equivalence classes in \mathbb{F}_{q}^{*} , which corresponds to the cosets of \langle \xi^{p_{1}p_{2}^{t} } \rangle in \mathbb{F}_{q}^{*} = \langle \xi \rangle .

    Before doing the explicit computation, we present a general method to factorize x^{n} - \lambda . Let q = p^{k} for k > 0 , and n = p^{e}p_{1}^{e_{1}} \cdots p_{m}^{e_{m}} be the prime factorization of n . Assume that p_{1}^{e_{1}} \cdots p_{m}^{e_{m}} \mid q-1 , i.e., v_{p_{i}}(q-1) \geq e_{i} for i = 1, \cdots, m . In this case we have

    \mathbb{F}_{q}^* = \langle\xi\rangle = \langle\xi^{p_{1}^{e_{1}}\cdots p_{m}^{e_{m}}}\rangle \cup \langle\xi^{p_{1}^{e_{1}}\cdots p_{m}^{e_{m}}}\rangle\xi^{p^{e}} \cup \cdots\cup\langle \xi^{p_{1}^{e_{1}}\cdots p_{m}^{e_{m}}}\rangle\xi^{p^{e}(p_{1}^{e_{1}}\cdots p_{m}^{e_{m}}-1)}.

    For \lambda\in \langle\xi^{p_{1}^{e_{1}}\cdots p_{m}^{e_{m}}}\rangle\xi^{j\cdot p^{e}} , where 0\leq j\leq p_{1}^{e_{1}}\cdots p_{m}^{e_{m}}-1 , there exists an element a\in \mathbb{F}_{q}^* such that

    a^{n}\lambda = \xi^{j\cdot p^{e}}.

    We first factorize x^{n} - \xi^{jp^{e}} , 0 \leq j \leq p_{1}^{e_{1}}\cdots p_{m}^{e_{m}}-1 . Notice that j can be written as j = y\cdot p_{1}^{v_{1}}\cdots p_{m}^{v_{m}} , where v_{i} = min\{e_{i}, v_{p_{i}}(j)\} . Then we have

    x^{n}-\xi^{j\cdot p^{e}} = (x^{p_{1}^{e_{1}}\cdots p_{m}^{e_{m}}}-\xi^{y\cdot p_{1}^{v_{1}}\cdots p_{m}^{v_{m}}})^{p^{e}} = \xi^{j\cdot p^{e}}((\dfrac{x^{p_{1}^{e_{1}-v_{1}}\cdots p_{m}^{e_{m}-v_{m}}}}{\xi^{y}})^{p_{1}^{v_{1}}\cdots p_{m}^{v_{m}}}-1)^{p^{e}}.

    Since p_{1}^{v_{1}}\cdots p_{m}^{v_{m}} \mid q-1 , \delta = \xi^{\frac{q-1}{p_{1}^{v_{1}}\cdots p_{m}^{v_{m}}}} is a primitive p_{1}^{v_{1}}\cdots p_{m}^{v_{m}} -th root of unit. Then

    \begin{equation*} \begin{array}{rcl} x^{n}-\xi^{j\cdot p^{e}}& = &\xi^{j\cdot p^{e}}(\frac{x^{p_{1}^{e_{1}-v_{1}}\cdots p_{m}^{e_{m}-v_{m}}}}{\xi^{y}}-1)^{p^{e}} \cdot(\frac{x^{p_{1}^{e_{1}-v_{1}}\cdots p_{m}^{e_{m}-v_{m}}}}{\xi^{y}}-\delta)^{p^{e}} \cdots(\frac{x^{p_{1}^{e_{1}-v_{1}}\cdots p_{m}^{e_{m}-v_{m}}}}{\xi^{y}}-\delta^{p_{1}^{v_{1}}\cdots p_{m}^{v_{m}}-1})^{p^{e}}\\ & = &(x^{p_{1}^{e_{1}-v_{1}}\cdots p_{m}^{e_{m}-v_{m}}}-\xi^{y})^{p^{e}}(x^{p_{1}^{e_{1}-v_{1}}\cdots p_{m}^{e_{m}-v_{m}}}-\delta\xi^{y})^{p^{e}} \cdots(x^{p_{1}^{e_{1}-v_{1}}\cdots p_{m}^{e_{m}-v_{m}}}-\delta^{p_{1}^{v_{1}}\cdots p_{m}^{v_{m}}-1}\xi^{y})^{p^{e}}. \end{array} \end{equation*}

    For 0\leq i\leq p_{1}^{v_{1}}\cdots p_{m}^{v_{m}}-1 , \delta^{i}\xi^{y} = \xi^{y+i\cdot \frac{q-1}{p_{1}^{v_{1}}\cdots p_{m}^{v_{m}}}} , and then we have

    \mathrm{ord}(\delta^{i}\xi^{y}) = \frac{q-1}{gcd(q-1, y+i\cdot \frac{q-1}{p_{1}^{v_{1}}\cdots p_{m}^{v_{m}}})},

    and

    \frac{q-1}{\mathrm{ord}(\delta^{i}\xi^{y})} = \gcd(q-1, y+i\cdot \frac{q-1}{p_{1}^{v_{1}}\cdots p_{m}^{v_{m}}}).

    For each p_{i}\mid p_{1}^{e_{1}-v_{1}}\cdots p_{m}^{e_{m}-v_{m}} , we have that e_{i} > v_{i} and v_{i} = v_{p_{i}}(j) , thus p_{i}\nmid y . Since v_{p_{i}}(q-1)\geq e_{i} > v_{i} , p_{i}\mid \frac{q-1}{p_{1}^{v_{1}}\cdots p_{m}^{v_{m}}} , which indicates that p_{i}\nmid y+i\cdot \frac{q-1}{p_{1}^{v_{1}}\cdots p_{m}^{v_{m}}} and p_{i}\mid \frac{q-1}{y+i\cdot \frac{q-1}{p_{1}^{v_{1}}\cdots p_{m}^{v_{m}}}} . Moreover if 4\mid p_{1}^{e_{1}-v_{1}}\cdots p_{m}^{e_{m}-v_{m}} , then 4\mid p_{1}^{e_{1}}\cdots p_{m}^{e_{m}}\mid q-1 . Hence by Lemma 2.2 each x^{p_{1}^{e_{1}-v_{1}}\cdots p_{m}^{e_{m}-v_{m}}}-\xi^{y}\delta^{i} is irreducible over \mathbb{F}_q .

    Notice that a^{n}\lambda = \xi^{jp^{e}} , then the irreducible factorization of x^{n} - \lambda follows immediately:

    \begin{eqnarray*} x^{n}-\lambda& = &(x^{p_{1}^{e_{1}-v_{1}}\cdots p_{m}^{e_{m}-v_{m}}}-a^{-p_{1}^{e_{1}-v_{1}}\cdots p_{m}^{e_{m}-v_{m}}}\xi^{y})^{p^{e}}(x^{p_{1}^{e_{1}-v_{1}}\cdots p_{m}^{e_{m}-v_{m}}}-a^{-p_{1}^{e_{1}-v_{1}}\cdots p_{m}^{e_{m}-v_{m}}}\delta\xi^{y})^{p^{e}}\cdot\\ &&\cdot\cdots(x^{p_{1}^{e_{1}-v_{1}}\cdots p_{m}^{e_{m}-v_{m}}}-a^{-p_{1}^{e_{1}-v_{1}}\cdots p_{m}^{e_{m}-v_{m}}}\delta^{p_{1}^{v_{1}}\cdots p_{m}^{v_{m}}-1}\xi^{y})^{p^{e}}, \end{eqnarray*}

    We summerize the above discussions into the following theorem.

    Theorem 4.1. Let p, p_{1}, \cdots, p_{m} be distinct prime numbers. Let q = p^{k} and n = p^{e}p_{1}^{e_{1}}\cdots p_{m}^{e_{m}} , where k, e, e_{1}, \cdots, e_{m} are positive integers. Suppose that for 1\leq i \leq m , v_{p_{i}}(q-1) \geq e_{i} . Then for any \lambda \in \mathbb{F}_{q}^{*} , there exists an element a \in \mathbb{F}_{q}^{*} such that a^{n}\lambda = \xi^{jp^{e}} , 0 \leq j \leq p_{1}^{e_{1}}\cdots p_{m}^{e_{m}} . Furthermore, writing j in the form j = y\cdot p_{1}^{v_{1}}\cdots p_{m}^{v_{m}} , where v_{i} = min\{e_{i}, v_{p_{i}}(j)\} , then

    \begin{eqnarray*} x^{n}-\lambda& = &(x^{p_{1}^{e_{1}-v_{1}}\cdots p_{m}^{e_{m}-v_{m}}}-a^{-p_{1}^{e_{1}-v_{1}}\cdots p_{m}^{e_{m}-v_{m}}}\xi^{y})^{p^{e}}(x^{p_{1}^{e_{1}-v_{1}}\cdots p_{m}^{e_{m}-v_{m}}}-a^{-p_{1}^{e_{1}-v_{1}}\cdots p_{m}^{e_{m}-v_{m}}}\delta\xi^{y})^{p^{e}}\cdot\\ &&\cdot\cdots(x^{p_{1}^{e_{1}-v_{1}}\cdots p_{m}^{e_{m}-v_{m}}}-a^{-p_{1}^{e_{1}-v_{1}}\cdots p_{m}^{e_{m}-v_{m}}}\delta^{p_{1}^{v_{1}}\cdots p_{m}^{v_{m}}-1}\xi^{y})^{p^{e}}, \end{eqnarray*}

    gives the irreducible factorization of x^{n}-\lambda over \mathbb{F}_q .

    Now we turn to the case that p_{1}^{e_{1}}\cdots p_{m}^{e_{m}}\nmid q-1 . Sinve \gcd(p_{1}^{e_{1}}\cdots p_{m}^{e_{m}}, q) = 1 , thus there exists a least positive integer d such that p_{1}^{e_{1}}\cdots p_{m}^{e_{m}}\mid q^{d}-1 . By the lifting-the-exponent lemma, if d' is the least positive integer such that p_{1}\cdots p_{m}\mid q^{d'}-1 , then d = d'p_{1}^{v_{1}}\cdots p_{m}^{v_{m}} , where v_{i} = \max\{e_{i}-v_{p_{i}}(q^{d'}-1), 0\} .

    Let \lambda be a nonzero element in \mathbb{F}_{q} . To obtain the irreducible factorization of x^{n}-\lambda over \mathbb{F}_q , we first consider the factorization over \mathbb{F}_{q^{d}} . By Theorem 4.1, there exists a \in \mathbb{F}_{q^{d}} such that a^{n}\lambda = \zeta^{jp^{e}} , 0 \leq j \leq p_{1}^{e_{1}}\cdots p_{m}^{e_{m}} -1 . Writing j as j = y\cdot p_{1}^{v_{1}}\cdots p_{m}^{v_{m}} , where v_{i} = min\{e_{i}, v_{p_{i}}(j)\} , then

    \begin{eqnarray*} x^{n}-\lambda& = &(x^{p_{1}^{e_{1}-v_{1}}\cdots p_{m}^{e_{m}-v_{m}}}-a^{-p_{1}^{e_{1}-v_{1}}\cdots p_{m}^{e_{m}-v_{m}}}\zeta^{y})^{p^{e}}(x^{p_{1}^{e_{1}-v_{1}}\cdots p_{m}^{e_{m}-v_{m}}}-a^{-p_{1}^{e_{1}-v_{1}}\cdots p_{m}^{e_{m}-v_{m}}}\delta\zeta^{y})^{p^{e}}\cdot\\ &&\cdot\cdots(x^{p_{1}^{e_{1}-v_{1}}\cdots p_{m}^{e_{m}-v_{m}}}-a^{-p_{1}^{e_{1}-v_{1}}\cdots p_{m}^{e_{m}-v_{m}}}\delta^{p_{1}^{v_{1}}\cdots p_{m}^{v_{m}}-1}\zeta^{y})^{p^{e}}, \end{eqnarray*}

    gives the irreducible factorization of x^{n}-\lambda over \mathbb{F}_{q^{d}} , where \delta is a primitive p_{1}^{v_{1}}\cdots p_{m}^{v_{m}} -th root of unit. Hence each irreducible factor of x^{n}-\lambda over \mathbb{F}_q is of the form

    \begin{eqnarray*} &&(x^{p_{1}^{e_{1}-v_{1}}\cdots p_{m}^{e_{m}-v_{m}}}-a^{-p_{1}^{e_{1}-v_{1}}\cdots p_{m}^{e_{m}-v_{m}}}\delta^{i}\zeta^{y})^{p^{e}}(x^{p_{1}^{e_{1}-v_{1}}\cdots p_{m}^{e_{m}-v_{m}}}-a^{-qp_{1}^{e_{1}-v_{1}}\cdots p_{m}^{e_{m}-v_{m}}}\delta^{qi}\zeta^{qy})^{p^{e}}\cdot\\ &&\cdot\cdots(x^{p_{1}^{e_{1}-v_{1}}\cdots p_{m}^{e_{m}-v_{m}}}-a^{-q^{z_{i}-1}p_{1}^{e_{1}-v_{1}}\cdots p_{m}^{e_{m}-v_{m}}}\delta^{i\cdot q^{z_{i}-1}}\zeta^{y\cdot q^{z_{i}-1}})^{p^{e}}, \end{eqnarray*}

    where z_{i} is the least positive integer such that a^{-q^{z_{i}}p_{1}^{e_{1}-v_{1}}\cdots p_{m}^{e_{m}-v_{m}}}\delta^{i\cdot q^{z_{i}}}\zeta^{y\cdot q^{z_{i}}} = a^{-p_{1}^{e_{1}-v_{1}}\cdots p_{m}^{e_{m}-v_{m}}}\delta^{i}\zeta^{y} .

    Now we determine the generator polynomials of all constacyclic codes of length p_{1}p_{2}^{t}p^{s} and their duals explicitly. We decompose the problem into three cases.

    As \gcd(q-1, p_{1}p_{2}^{t}p^{s}) = 1 , all constacyclic codes of length p_{1}p_{2}^{t}p^{s} are equivalent to a cyclic code. By the factorization of x^{p_{1}p_{2}^{t}p^{s}}-1 given in Corollary 3.2, we have the following result. For any polynomial

    F = a_{0}+ a_{1}x +\cdots + a_{n}x^{n}, \ a_{n} \neq 0,

    we set \widehat{F} = a_{n}^{-1}F to be the monic polynomial associated to F .

    Proposition 4.1. Assume that \gcd(q-1, p_{1}p_{2}^{t}p^{s}) = 1 . Then any nonzero element \lambda in \mathbb{F}_{q} is p_{1}p_{2}^{t}p^{s} -equivalent to 1, that is, there is an element a \in \mathbb{F}_{q}^{*} such that a^{p_{1}p_{2}^{t}p^{s}}\lambda = 1 . Furthermore, the irreducible factorization of x^{p_{1}p_{2}^{t}p^{s}}-\lambda over \mathbb{F}_q is given by

    x^{p_{1}p_{2}^{t}p^{s}}-\lambda = \widehat{C}_{0}(ax)^{p^{s}}\prod\limits_{r = 0}^{t-1}\prod\limits_{k_{1} = 0}^{g_{1}-1}\prod\limits_{k_{2} = 0}^{g_{2, t-r}\gcd(f_{1}, f_{2, t-r})-1} \widehat{C}_{\mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{2}^{r}}(ax)^{p^{s}}\prod\limits_{k = 0}^{g_{1}-1} \widehat{C}_{\mu_{1}^{k}p_{2}^{t}}(ax)^{p^{s}}\prod\limits_{r = 0}^{t-1}\prod\limits_{k^{\prime} = 0}^{g_{2, t-r}-1} \widehat{C}_{\mu_{2}^{k^{\prime}}p_{1}p_{2}^{r}}(ax)^{p^{s}}.

    Therefore all the constacyclic codes of length p_{1}p_{2}^{t}p^{s} are

    C = \left(\widehat{C}_{0}(ax)^{u}\prod\limits_{r = 0}^{t-1}\prod\limits_{k_{1} = 0}^{g_{1}-1}\prod\limits_{k_{2} = 0}^{g_{2, t-r}\gcd(f_{1}, f_{2, t-r})-1} \widehat{C}_{\mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{2}^{r}}(ax)^{v_{\mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{2}^{r}}}\prod\limits_{k = 0}^{g_{1}-1} \widehat{C}_{\mu_{1}^{k}p_{2}^{t}}(ax)^{w_{\mu_{1}^{k}p_{2}^{t}}}\prod\limits_{r = 0}^{t-1}\prod\limits_{k^{\prime} = 0}^{g_{2, t-r}-1} \widehat{C}_{\mu_{2}^{k^{\prime}}p_{1}p_{2}^{r}}(ax)^{x_{\mu_{2}^{k^{\prime}}p_{1}p_{2}^{r}}}\right),

    where 0\leq u, v_{\mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{2}^{r}}, w_{\mu_{1}^{k}p_{2}^{t}}, x_{\mu_{2}^{k^{\prime}}p_{1}p_{2}^{r}}\leq p^{s} , with duals

    \begin{eqnarray*} C^{\bot}& = &\left(\widehat{C}_{0}(a^{-1}x)^{p^{s}-u}\prod\limits_{r = 0}^{t-1}\prod\limits_{k_{1} = 0}^{g_{1}-1}\prod\limits_{k_{2} = 0}^{g_{2, t-r}\gcd(f_{1}, f_{2, t-r})-1} \widehat{C}_{\mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{2}^{r}}(a^{-1}x)^{p^{s}-v_{\mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{2}^{r}}}\prod\limits_{k = 0}^{g_{1}-1} \widehat{C}_{\mu_{1}^{k}p_{2}^{t}}(a^{-1}x)^{p^{s}-w_{\mu_{1}^{k}p_{2}^{t}}}\right.\\ &&\left.\prod\limits_{r = 0}^{t-1}\prod\limits_{k^{\prime} = 0}^{g_{2, t-r}-1} \widehat{C}_{\mu_{2}^{k^{\prime}}p_{1}p_{2}^{r}}(a^{-1}x)^{p^{s}-x_{\mu_{2}^{k^{\prime}}p_{1}p_{2}^{r}}}\right). \end{eqnarray*}

    For this case, since p_{1}p_{2}^{t}\vert q-1 , the following proposition follows straightly from Theorem 4.1.

    Theorem 4.2. Assume that \gcd(q-1, p_{1}p_{2}^{t}p^{s}) = p_{1}p_{2}^{t} . Then for any \lambda\in \mathbb{F}_{q}^* , there exists an element a\in \mathbb{F}_{q}^* such that a^{p_{1}p_{2}^{t}p^{s}}\lambda = \xi^{j\cdot p^{s}} , 0\leq j\leq p_{1}p_{2}^{t}-1 . Writing j as j = y\cdot p_{1}^{v_{1}}p_{2}^{v_{2}} , where v_{1} = \min\{1, v_{p_{1}}(j)\} and v_{2} = \min\{t, v_{p_{2}}(j)\} , then

    \begin{eqnarray*} x^{p_{1}p_{2}^{t}p^{s}}-\lambda& = &(x^{p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}}-a^{-p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}}\xi^{y})^{p^{s}}(x^{p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}}-a^{-p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}}\delta\xi^{y})^{p^{s}}\\ &&\cdots(x^{p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}}-a^{-p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}}\delta^{p_{1}^{v_{1}}p_{2}^{v_{2}}-1}\xi^{y})^{p^{s}} \end{eqnarray*}

    gives the irreducible factorization of x^{p_{1}p_{2}^{t}p^{s}}-\lambda over \mathbb{F}_{q} . Therefore all the \lambda -constacyclic codes of length p_{1}p_{2}^{t}p^{s} and their dual codes are given by

    \begin{eqnarray*} C& = &\left((x^{p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}}-a^{-p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}}\xi^{y})^{u_{1}}(x^{p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}}-a^{-p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}}\delta\xi^{y})^{u_{2}}\right.\\ &&\left.\cdots(x^{p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}}-a^{-p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}}\delta^{p_{1}^{v_{1}}p_{2}^{v_{2}}-1}\xi^{y})^{u _{p_{1}^{v_{1}}p_{2}^{v_{2}}}}\right), \end{eqnarray*}

    and

    \begin{eqnarray*} C^{\bot}& = &\left((x^{p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}}-a^{p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}}\xi^{-y})^{p^{s}-u_{1}}(x^{p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}}-a^{p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}}\delta^{-1}\xi^{-y})^{p^{s}-u_{2}}\right.\\ &&\left.\cdots(x^{p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}}-a^{p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}}\delta^{1-p_{1}^{v_{1}}p_{2}^{v_{2}}}\xi^{-y})^{p^{s}-u_{p_{1}^{v_{1}}p_{2}^{v_{2}}}}\right), \end{eqnarray*}

    where 0\leq u_{1}, u_{2}, \cdots, u_{n^{v_{1}}\ell^{v_{2}}}\leq p^{s} .

    In this case, for any d\geq 1 we have f_{2, d} = p_{2}^{max\{0, d-r\}} , and f = \mathrm{lcm}(f_{1}, f_{2, t}) is the least positive integer such that q^{f}\equiv 1 \pmod {p_1p_{2}^{t}} . By the bais results of finite fields, there is a primitive element \zeta in \mathbb{F}_{q^{f}}^{*} such that \xi = \zeta^{\frac{q^{f}-1}{q-1}} = \zeta^{1+q+\cdots+q^{f-1}} . Then we have

    \mathbb{F}_{q}^* = \langle\xi\rangle = \langle\xi^{p_{2}^{r}}\rangle\cup \langle\xi^{p_{2}^{r}}\rangle\xi^{p^{s}}\cup \cdots\cup \langle\xi^{p_{2}^{r}}\rangle\xi^{(p_{2}^{r}-1)p^{s}}

    and

    \mathbb{F}_{q^{f}}^* = \langle\zeta\rangle = \langle\zeta^{p_{1}p_{2}^{t}}\rangle\cup \langle\zeta^{p_{1}p_{2}^{t}}\rangle\zeta^{p^{s}}\cup \cdots\cup \langle\zeta^{p_{1}p_{2}^{t}}\rangle\zeta^{(p_{1}p_{2}^{t} -1)p^{s}}.

    By the assumption that p_{1}p_{2}^{t}\mid q^{f}-1 and v_{p_{1}}(q-1) = 0 , v_{p_{2}}(q-1) = r , we have that p_{1}p_{2}^{t-r}\mid (1+q+\cdots+q^{f-1}) . Therefore \xi^{p_{2}^{r}} = \zeta^{p_{2}^{r}(1+q+\cdots+q^{f-1})}\in \langle\zeta^{p_{1}p_{2}^{t}}\rangle . Furthermore, for 0\leq j\leq p_{2}^{r}-1 , there exists some 0\leq j^{'}\leq p_{1}p_{2}^{t}-1 such that jp^{s}(1+q+\cdots+q^{f-1})\equiv j^{'}p^{s} \pmod {p_{1}p_{2}^{t}} , that is, \xi^{jp^{s}}\in \langle\zeta^{p_{1}p_{2}^{t}}\rangle\zeta^{j^{'}p^{s}} . Hence we have the following theorem.

    Theorem 4.3. Assume that \gcd(q-1, p_{1}p_{2}^{t}p^{s}) = p_{2}^{r} , 0 < r \leq t . For any 0\leq j\leq p_{2}^{r}-1 , there exists an element a\in \mathbb{F}_{q^{f}}^{*} such that a^{p_{1}p_{2}^{t}p^{s}}\xi^{j\cdot p^{s}} = \zeta^{j'\cdot p^{s}} . Moreover, each irreducible factor of x^{p_{1}p_{2}^{t}}-\xi^{j} over \mathbb{F}_{q} is of the form

    \begin{eqnarray*} &&(x^{p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}}-a^{-p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}}\delta^{i}\zeta^{y'})(x^{p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}}-a^{-p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}\cdot q}\delta^{iq}\zeta^{y'q})\\ &&\cdots(x^{p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}}-a^{-p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}\cdot q^{z_{i}-1}}\delta^{iq^{z_{i}-1}}\zeta^{y'q^{z_{i}-1}}), \end{eqnarray*}

    where j' = y'p_{1}^{v_{1}}p_{2}^{v_{2}} , v_{1} = \min\{1, v_{p_{1}}(j')\} , v_{2} = \min\{t, v_{p_{2}}(j')\} , and z_{i} is the least positive integer such that a^{-q^{z_{i}}p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}}\delta^{iq^{z_{i}}}\zeta^{y'q^{z_{i}}} = a^{p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}}\delta^{i}\zeta^{y'} .

    For any 0\leq i, i^{'}\leq p_{1}^{v_{1}}p_{2}^{v_{2}}-1 , we define a relation \sim to be such that i\sim i^{'} if and only if a^{-q^{m}p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}}\delta^{iq^{m}}\zeta^{y'q^{m}} = a^{p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}}\delta^{i^{'}}\zeta^{y'} for some nonnegative integers m . It is obvious to see that \sim is an equivalence relation. Assume that S is a complete system of equivalence class representatives of \{0, 1, \cdots, p_{1}^{v_{1}}p_{•}^{v_{2}}-1\} relative to this relation \sim . For any i\in S we denote the irreducible polynomial

    \begin{eqnarray*} &&(x^{p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}}-a^{-p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}}\delta^{i}\zeta^{y'})(x^{p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}}-a^{-p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}\cdot q}\delta^{iq}\zeta^{y'q})\\ &&\cdots(x^{p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}}-a^{-p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}\cdot q^{z_{i}-1}}\delta^{iq^{z_{i}-1}}\zeta^{y'q^{z_{i}-1}}), \end{eqnarray*}

    by M_{i}(x) . Then we have the following corollary.

    Corollary 4.1. Assume that \gcd(q-1, p_{1}p_{2}^{t}p^{s}) = p_{2}^{r} . For any 0\leq j\leq p_{2}^{r}-1 , there exists an element a\in \mathbb{F}_{q^{f}}^{*} such that a^{p_{1}p_{2}^{t}p^{s}}\xi^{j\cdot p^{s}} = \zeta^{j'\cdot p^{s}} . Then

    x^{p_{1}p_{2}^{t}p^{s}}-\xi^{j p^{s}} = \prod\limits_{i\in S}M_{i}(x)^{p^{s}}

    gives the irreducible factorization of x^{p_{1}p_{2}^{t}p^{s}}-\xi^{j p^{s}} over \mathbb{F}_q . Furthermore we have that

    C = \left(\prod\limits_{i\in S}M_{i}(x)^{u_{i}}\right),

    and

    C^{\bot} = \left(\prod\limits_{i\in S}M_{i}^{*}(x)^{p^{s}-u_{i}}\right),

    where 0\leq u_{i}\leq p^{s} , for i\in S .

    The same argument as in the last section can be applied in this situation, only noticing that the least positive integer f such that q^{f}\equiv 1 \pmod {p_1p_2^t} is f = f_{2, t} = p_2^{\max\{0, t-r\}} . We find a primitive element \zeta in \mathbb{F}_{q^{f}}^{*} such that \xi = \zeta^{\frac{q^{f}-1}{q-1}} = \zeta^{1+q+\cdots+q^{f-1}} , then

    \mathbb{F}_{q}^* = \langle\xi\rangle = \langle\xi^{p_{1}p_{2}^{r}}\rangle\cup \langle\xi^{p_{1}p_{2}^{r}}\rangle\xi^{p^{s}}\cup \cdots\cup \langle\xi^{p_{1}p_{2}^{r}}\rangle\xi^{(p_{2}^{r}-1)p^{s}}

    and

    \mathbb{F}_{q^{f}}^* = \langle\zeta\rangle = \langle\zeta^{p_{1}p_{2}^{t}}\rangle\cup \langle\zeta^{p_{1}p_{2}^{t}}\rangle\zeta^{p^{s}}\cup \cdots\cup \langle\zeta^{p_{1}p_{2}^{t}}\rangle\zeta^{(p_{1}p_{2}^{t} -1)p^{s}}.

    By the assumption that p_{1}p_{2}^{t}\mid q^{f}-1 and v_{p_{2}}(q-1) = r , we have that p_{2}^{t-r}\mid (1+q+\cdots+q^{f-1}) , and \xi^{p_{1}p_{2}^{r}} = \zeta^{p_{1}p_{2}^{r}(1+q+\cdots+q^{f-1})}\in \langle\zeta^{p_{1}p_{2}^{t}}\rangle . Furthermore, for 0\leq j\leq p_{1}p_{2}^{r}-1 , there exists some 0\leq j^{'}\leq p_{1}p_{2}^{t}-1 such that jp^{s}(1+q+\cdots+q^{f-1})\equiv j^{'}p^{s} \pmod {p_1p_2^t} , that is, \xi^{jp^{s}}\in \langle\zeta^{p_{1}p_{2}^{t}}\rangle\zeta^{j^{'}p^{s}} . Hence we have the following theorem.

    Theorem 4.4. Assume that \gcd(q-1, p_{1}p_{2}^{t}p^{s}) = p_{1}p_{2}^{r} for 0 < r < t , then for any 0\leq j\leq p_{2}^{r}-1 , there exists an element a\in \mathbb{F}_{q^{f}}^{*} such that a^{p_{1}p_{2}^{t}p^{s}}\xi^{j\cdot p^{s}} = \zeta^{j'\cdot p^{s}} . Moreover, each irreducible factor of x^{p_{1}p_{2}^{t}}-\xi^{j} over \mathbb{F}_{q} is of the form

    \begin{eqnarray*} &&(x^{p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}}-a^{-p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}}\delta^{i}\zeta^{y'})(x^{p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}}-a^{-p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}\cdot q}\delta^{iq}\zeta^{y'q})\\ &&\cdots(x^{p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}}-a^{-p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}\cdot q^{z_{i}-1}}\delta^{iq^{z_{i}-1}}\zeta^{y'q^{z_{i}-1}}), \end{eqnarray*}

    where j' = y'p_{1}^{v_{1}}p_{2}^{v_{2}} , v_{1} = \min\{1, v_{p_{1}}(j')\} , v_{2} = \min\{t, v_{p_{2}}(j')\} , and z_{i} is the least positive integer such that a^{-q^{z_{i}}p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}}\delta^{iq^{z_{i}}}\zeta^{y'q^{z_{i}}} = a^{p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}}\delta^{i}\zeta^{y'} .

    For any 0\leq i, i^{'}\leq p_{1}^{v_{1}}p_{2}^{v_{2}}-1 , we define a relation \sim to be such that i\sim i^{'} if and only if a^{-q^{m}p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}}\delta^{iq^{m}}\zeta^{y'q^{m}} = a^{p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}}\delta^{i^{'}}\zeta^{y'} for some nonnegative integers m . It is obvious to see that \sim is an equivalence relation. Assume that S is a complete system of equivalence class representatives of \{0, 1, \cdots, p_{1}^{v_{1}}p_2^{v_{2}}-1\} relative to this relation \sim . For any i\in S we denote the irreducible polynomial

    \begin{eqnarray*} &&(x^{p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}}-a^{-p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}}\delta^{i}\zeta^{y'})(x^{p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}}-a^{-p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}\cdot q}\delta^{iq}\zeta^{y'q})\\ &&\cdots(x^{p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}}-a^{-p_{1}^{1-v_{1}}p_{2}^{t-v_{2}}\cdot q^{z_{i}-1}}\delta^{iq^{z_{i}-1}}\zeta^{y'q^{z_{i}-1}}), \end{eqnarray*}

    by M_{i}(x) . Then we have the following corollary.

    Corollary 4.2. Assume that \gcd(q-1, p_{1}p_{2}^{t}p^{s}) = p_{1}p_{2}^{r} for 0 < r < t . For any 0\leq j\leq p_{2}^{r}-1 , there exists an element a\in \mathbb{F}_{q^{f}}^{*} such that a^{p_{1}p_{2}^{t}p^{s}}\xi^{j\cdot p^{s}} = \zeta^{j'\cdot p^{s}} . Then

    x^{p_{1}p_{2}^{t}p^{s}}-\xi^{j p^{s}} = \prod\limits_{i\in Z}M_{i}(x)^{p^{s}}

    gives the irreducible factorization of x^{p_{1}p_{2}^{t}p^{s}}-\xi^{j p^{s}} over \mathbb{F}_q . Furthermore we have that

    C = \left(\prod\limits_{i\in S}M_{i}(x)^{u_{i}}\right),

    and

    C^{\bot} = \left(\prod\limits_{i\in S}M_{i}^{*}(x)^{p^{s}-u_{i}}\right),

    where 0\leq u_{i}\leq p^{s} , for i\in S .

    Based on the results in the last section, we now give all the self-dual cyclic codes of length p_{1}p_{2}^{t}p^{s} over \mathbb{F}_q and their enumeration. It is a well-known conclusion that self-dual cyclic codes of length N over \mathbb{F}_q exists if and only if N is even and the characteristic of \mathbb{F}_q is 2 . Therefore we only consider the case of self-dual cyclic codes of length p_{1}p_{2}^{t}\cdot 2^{s} over \mathbb{F}_{2^{k}} .

    Let x^{p_{1}p_{2}^{t}2^{s}}-1 = (x^{p_{1}p_{2}^{t}}-1)^{2^{s}} = f_{1}(x)^{2^{s}}\cdots f_{n}(x)^{2^{s}}h_{1}(x)^{2^{s}}\cdots h_{m}(x)^{2^{s}}h_{1}^{*}(x)^{2^{s}}\cdots h_{m}^{*}(x)^{2^{s}} be the irreducible factorization of x^{p_{1}p_{2}^{t}2^{s}}-1 over \mathbb{F}_q , where each f_{i}(x) is a monic irreducible self-reciprocal polynomial for 1\leq i\leq n , and h_{j}^{*}(x) is the reciprocal polynomial of h_{j}(x) for each 1\leq j\leq m . Now, given a cyclic code C = (g(x)) of length p_{1}p_{2}^{t}2^{s} , it can be written in the form

    g(x) = f_{1}(x)^{\tau_{1}}\cdots f_{n}(x)^{\tau_{n}}h_{1}(x)^{\delta_{1}}\cdots h_{m}(x)^{\delta_{m}}h_{1}^{*}(x)^{\sigma_{1}}\cdots h_{m}^{*}(x)^{\sigma_{m}},

    where 0\leq \tau_{i}, \delta_{j}, \sigma_{j}\leq 2^{s} for any 1\leq i\leq n and 1\leq j\leq m . Then the reciprocal polynomial h^{*}(x) of the parity check polynomial h(x) of C is

    h^{*}(x) = f_{1}(x)^{2^{s}-\tau_{1}}\cdots f_{n}(x)^{2^{s}-\tau_{n}}h_{1}(x)^{2^{s}-\sigma_{1}}\cdots h_{m}(x)^{2^{s}-\sigma_{m}}h_{1}^{*}(x)^{2^{s}-\delta_{1}}\cdots h_{m}^{*}(x)^{2^{s}-\delta_{m}}.

    Therefore it is obvious to see that the following theorem holds.

    Theorem 5.1. With the above notations, we have that C is self-dual if and only if 2\tau_{i} = 2^{s} for 1\leq i\leq n , and \delta_{j}+\sigma_{j} = 2^{s} for 1\leq j\leq m .

    Recall the irreducible factorization of x^{p_{1}p_{2}^{t}p^{s}}-1 given in Corollary 3.2. Now we determine for each irreducible factor its reciprocal polynomial.

    Lemma 5.1. Let the notations be defined as Corollary 3.1. Then one of the following holds.

    (1) If both f_{1} and f_{2} are odd, then we have that

    C_{0}^{*} = C_{0}, \ C_{\mu_{1}^{k}p_{2}^{t}}^{*} = C_{-\mu_{1}^{k}p_{2}^{t}}, \ C_{\mu_{2}^{k^{\prime}}p_{1}p_{2}^{r}}^{*} = C_{-\mu_{2}^{k^{\prime}}p_{1}p_{2}^{r}}, \ C_{\mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{2}^{r}}^{*} = C_{-\mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{2}^{r}}.

    (2) If f_{1} is odd and f_{2} is even, then we have that

    C_{0}^{*} = C_{0}, \ C_{\mu_{1}^{k}p_{2}^{t}}^{*} = C_{-\mu_{1}^{k}p_{2}^{t}}, \ C_{\mu_{2}^{k^{\prime}}p_{1}p_{2}^{r}}^{*} = C_{\mu_{2}^{k^{\prime}}p_{1}p_{2}^{r}}, \ C_{\mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{2}^{r}}^{*} = C_{-\mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{2}^{r}}.

    (3) If f_{1} is even and f_{2} is odd, then we have that

    C_{0}^{*} = C_{0}, \ C_{\mu_{1}^{k}p_{2}^{t}}^{*} = C_{\mu_{1}^{k}p_{2}^{t}}, \ C_{\mu_{2}^{k^{\prime}}p_{1}p_{2}^{r}}^{*} = C_{-\mu_{2}^{k^{\prime}}p_{1}p_{2}^{r}}, \ C_{\mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{2}^{r}}^{*} = C_{-\mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{2}^{r}}.

    (4) If both f_{1} and f_{2} are even, then we have when v_{2}(f_{1})\neq v_{2}(f_{2}) ,

    C_{0}^{*} = C_{0}, \ C_{\mu_{1}^{k}p_{2}^{t}}^{*} = C_{\mu_{1}^{k}p_{2}^{t}}, \ C_{\mu_{2}^{k^{\prime}}p_{1}p_{2}^{r}}^{*} = C_{\mu_{2}^{k^{\prime}}p_{1}p_{2}^{r}}, \ C_{\mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{2}^{r}}^{*} = C_{-\mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{2}^{r}},

    when v_{2}(f_{1}) = v_{2}(f_{2}) ,

    C_{0}^{*} = C_{0}, \ C_{\mu_{1}^{k}p_{2}^{t}}^{*} = C_{\mu_{1}^{k}p_{2}^{t}}, \ C_{\mu_{2}^{k^{\prime}}p_{1}p_{2}^{r}}^{*} = C_{\mu_{2}^{k^{\prime}}p_{1}p_{2}^{r}}, \ C_{\mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{2}^{r}}^{*} = C_{-\mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{2}^{r}}.

    Proof. First it is trivial that the reciprocal of C_{0} is always itself. For C_{\mu_{1}^{k}p_{2}^{t}} , notice that C_{\mu_{1}^{k}p_{2}^{t}}^{*} = C_{\mu_{1}^{k}p_{2}^{t}} if and only if the congruence equation -\mu_{1}^{k}p_{2}^{t}\equiv -\mu_{1}^{k}p_{2}^{t}q^{x} \pmod {p_1p_{2}^{t}} is solvable. Since the equation is equivalent to -1\equiv q^{x} \pmod {p_2^{r}} , then the condition holds if and only if f_{1} = \mathrm{ord}_{p_{1}}(q) is even. In the similar way we can check that C_{\mu_{2}^{k^{\prime}}p_{1}p_{2}^{r}}^{*} = C_{\mu_{2}^{k^{\prime}}p_{1}p_{2}^{r}} if and only if f_{2, t-r} = f_{2}p_{2}^{max\{0, t-r\}} is even. Notice that by assumption p_{2} is odd, therefore the condition holds if and only if f_{2} is even. For C_{\mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{2}^{r}} , consider the congruence equation -\mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{2}^{r}\equiv \mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{2}^{r}q^{x} \pmod {p_1p_{2}^{t}} . It is equivalent to that -1\equiv q^{x} \pmod {p_1} and -1\equiv q^{x} \pmod {p_2^{t-r}} holds simultaneously. This requires not only both f_{1} and f_{2} are even, but also \gcd(f_{1}, f_{2, t-r})\mid\dfrac{f_{1}-f_{2, t-r}}{2} . And it is trivial to check that the last condition holds if and only if v_{2}(f_{1}) = v_{2}(f_{2, t-r}) = v_{2}(f_{2}) .

    Based on the above lemma, we now determine all the self-dual cyclic codes of length p_{1}p_{2}^{t} and their enumeration.

    Theorem 5.2.

    (1) If both f_{1} and f_{2} are odd, then there exist (2^{s}+1)^{\frac{p_{1}p_{2}^{t}-1}{2}} self-dual cyclic codes of length p_{1}p_{2}^{t} over \mathbb{F}_{2^{k}} , which are given by

    \begin{eqnarray*} &\left((x-1)^{2^{s-1}}\prod\nolimits_{r = 0}^{t-1}\prod\nolimits_{k_{1} = 0}^{\frac{g_{1}}{2}-1}\prod\nolimits_{k_{2} = 0}^{g_{2, t-r}\gcd(f_{1}, f_{2, t-r})-1} C_{\mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{2}^{r}}(x)^{v_{\mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{2}^{r}}} C_{-\mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{2}^{r}}(x)^{2^{s}-v_{\mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{2}^{r}}} \right.\\ &\left.\cdot\prod\nolimits_{k = 0}^{\frac{g_{1}}{2}-1} C_{\mu_{1}^{k}p_{2}^{t}}(x)^{w_{\mu_{1}^{k}p_{2}^{t}}} C_{-\mu_{1}^{k}p_{2}^{t}}(x)^{2^{s}-w_{\mu_{1}^{k}p_{2}^{t}}} \prod\nolimits_{r = 0}^{t-1}\prod\nolimits_{k^{\prime} = 0}^{\frac{g_{2, t-r}\gcd(f_{1}, f_{2, t-r})}{2}-1} C_{\mu_{2}^{k^{\prime}}p_{1}p_{2}^{r}}(x)^{x_{\mu_{2}^{k^{\prime}}p_{1}p_{2}^{r}}} C_{-\mu_{2}^{k^{\prime}}p_{1}p_{2}^{r}}(x)^{2^{s}-x_{\mu_{2}^{k^{\prime}}p_{1}p_{2}^{r}}}\right). \end{eqnarray*}

    (2) If f_{1} is odd and f_{2} is even, then there exist (2^{s}+1)^{\frac{p_{1}(p_{2}^{t}-1)}{2}} self-dual cyclic codes of length p_{1}p_{2}^{t} over \mathbb{F}_{2^{k}} , which are given by

    \begin{eqnarray*} &\left((x-1)^{2^{s-1}}\prod\nolimits_{r = 0}^{t-1}\prod\nolimits_{k_{1} = 0}^{\frac{g_{1}}{2}-1}\prod\nolimits_{k_{2} = 0}^{g_{2, t-r}\gcd(f_{1}, f_{2, t-r})-1} C_{\mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{2}^{r}}(x)^{v_{\mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{2}^{r}}} C_{-\mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{2}^{r}}(x)^{2^{s}-v_{\mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{2}^{r}}} \right.\\ &\left.\cdot\prod\nolimits_{k = 0}^{\frac{g_{1}}{2}-1} C_{\mu_{1}^{k}p_{2}^{t}}(x)^{w_{\mu_{1}^{k}p_{2}^{t}}} C_{-\mu_{1}^{k}p_{2}^{t}}(x)^{2^{s}-w_{\mu_{1}^{k}p_{2}^{t}}} \prod\nolimits_{r = 0}^{t-1}\prod\nolimits_{k^{\prime} = 0}^{g_{2, t-r}\gcd(f_{1}, f_{2, t-r})-1} C_{\mu_{2}^{k^{\prime}}p_{1}p_{2}^{r}}(x)^{2^{s-1}} \right). \end{eqnarray*}

    (3) If f_{1} is even and f_{2} is odd, then there exist (2^{s}+1)^{\frac{p_{2}^{t}(p_{1}-1)}{2}} self-dual cyclic codes of length p_{1}p_{2}^{t} over \mathbb{F}_{2^{m}} , which are given by

    \begin{eqnarray*} &\left((x-1)^{2^{s-1}}\prod\nolimits_{r = 0}^{t-1}\prod\nolimits_{k_{1} = 0}^{g_{1}-1}\prod\nolimits_{k_{2} = 0}^{\frac{g_{2, t-r}\gcd(f_{1}, f_{2, t-r})}{2}-1} C_{\mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{2}^{r}}(x)^{v_{\mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{2}^{r}}} C_{-\mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{2}^{r}}(x)^{2^{s}-v_{\mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{2}^{r}}} \right.\\ &\left.\cdot\prod\nolimits_{k = 0}^{g_{1}-1} C_{\mu_{1}^{k}p_{2}^{t}}(x)^{2^{s-1}} \prod\nolimits_{r = 0}^{t-1}\prod\nolimits_{k^{\prime} = 0}^{\frac{g_{2, t-r}\gcd(f_{1}, f_{2, t-r})}{2}-1} C_{\mu_{2}^{k^{\prime}}p_{1}p_{2}^{r}}(x)^{x_{\mu_{2}^{k^{\prime}}p_{1}p_{2}^{r}}} C_{-\mu_{2}^{k^{\prime}}p_{1}p_{2}^{r}}(x)^{2^{s}-x_{\mu_{2}^{k^{\prime}}p_{1}p_{2}^{r}}}\right). \end{eqnarray*}

    (4) If both f_{1} and f_{2} are even, then we have when v_{2}(f_{1})\neq v_{2}(f_{2}) , there exist (2^{s}+1)^{\frac{(p_{1}-1)(p_{2}^{t}-1)}{2}} self-dual cyclic codes of length p_{1}p_{2}^{t} over \mathbb{F}_{2^{m}} , which are given by

    \begin{eqnarray*} &\left((x-1)^{2^{s-1}}\prod\nolimits_{r = 0}^{t-1}\prod\nolimits_{k_{1} = 0}^{g_{1}-1}\prod\nolimits_{k_{2} = 0}^{\frac{g_{2, t-r}\gcd(f_{1}, f_{2, t-r})}{2}-1} C_{\mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{2}^{r}}(x)^{v_{\mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{2}^{r}}} C_{-\mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{2}^{r}}(x)^{2^{s}-v_{\mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{2}^{r}}} \right.\\ &\left.\cdot\prod\nolimits_{k = 0}^{g_{1}-1} C_{\mu_{1}^{k}p_{2}^{t}}(x)^{2^{s-1}} \prod\nolimits_{r = 0}^{t-1}\prod\nolimits_{k^{\prime} = 0}^{g_{2, t-r}\gcd(f_{1}, f_{2, t-r})-1} C_{\mu_{2}^{k^{\prime}}p_{1}p_{2}^{r}}(x)^{2^{s-1}} \right). \end{eqnarray*}

    When v_{2}(f_{1}) = v_{2}(f_{2}) , there exist only one self-dual cyclic codes of length p_{1}p_{2}^{t} over \mathbb{F}_{2^{m}} , which is given by

    \begin{eqnarray*} &\left((x-1)^{2^{s-1}}\prod\nolimits_{r = 0}^{t-1}\prod\nolimits_{k_{1} = 0}^{g_{1}-1}\prod\nolimits_{k_{2} = 0}^{g_{2, t-r}\gcd(f_{1}, f_{2, t-r})-1} C_{\mu_{1}^{k_{1}}\mu_{2}^{k_{2}}p_{2}^{r}}(x)^{2^{s-1}} \right.\\ &\left.\cdot\prod\nolimits_{k = 0}^{g_{1}-1} C_{\mu_{1}^{k}p_{2}^{t}}(x)^{2^{s-1}} \prod\nolimits_{r = 0}^{t-1}\prod\nolimits_{k^{\prime} = 0}^{g_{2, t-r}\gcd(f_{1}, f_{2, t-r})-1} C_{\mu_{2}^{k^{\prime}}p_{1}p_{2}^{r}}(x)^{2^{s-1}} \right). \end{eqnarray*}

    In this section, we illustrate the above process with the example of constacyclic codes of length 5\ell p^{s} , where \ell is a prime number different from 5 and p . We determine all the constacyclic codes of length 5\ell p^{s} and their dual codes over \mathbb{F}_{q} , and then all the self-dual codes of length 5\ell p^{s} are also given.

    First we determine all the q -cyclotomic cosets modulo 5\ell . Let f = \mathrm{ord}_{\ell}(q) , and e = \dfrac{\ell-1}{f} . Then we have:

    (1) \mathrm{ord}_{5\ell}(q) = f , when q\equiv 1 \pmod 5 .

    (2) \mathrm{ord}_{5\ell}(q) = f , when q\equiv 4 \pmod 5 with f even.

    (3) \mathrm{ord}_{5\ell}(q) = 2f , when q\equiv 4 \pmod 5 with f odd.

    (4) \mathrm{ord}_{5\ell}(q) = f , when q\equiv 2 or q\equiv 3 \pmod 5 with 4\mid f .

    (5) \mathrm{ord}_{5\ell}(q) = 2f , when q\equiv 2 or q\equiv 3 \pmod 5 with 2\mid f but 4\nmid f .

    (6) \mathrm{ord}_{5\ell}(q) = 4f , when q\equiv 2 or q\equiv 3 \pmod 5 with f odd.

    As the discussion given in the Section 3, we can find a primitive root \mu modulo \ell^{t} for all t\geq 1 such that \mu\equiv 1 \pmod 5 . The following lemma give more explicit formula for the q -cyclotomic cosets modulo 5\ell .

    Lemma 6.1.

    (1) If q\equiv 1 \pmod 5 , then we have that all the distinct q -cyclotomic cosets modulo 5\ell are given by C_{0} = \{0\} , C_{\ell} = \{\ell\} , C_{2\ell} = \{2\ell\} , C_{-\ell} = \{-\ell\} , C_{-2\ell} = \{-2\ell\} , and C_{a\mu^{k}} = \{a\mu^{k}, a\mu^{k}q, \cdots, a\mu^{k}q^{f-1}\} for a\in R = \{1, 2, -1, -2, 5\} and 0\leq k\leq e-1 .

    (2) If q\equiv 4 \pmod 5 and f is even, we have that all the distinct q -cyclotomic cosets modulo 5\ell are given by C_{0} = \{0\} , C_{\ell} = \{\ell, \ell q\} , C_{2\ell} = \{2\ell, 2\ell q\} , C_{\mu^{k'}} = \{\mu^{k'}, \mu^{k'}q, \cdots, \mu^{k'}q^{f-1}\} , C_{2\mu^{k'}} = \{2\mu^{k'}, 2\mu^{k'}q, \cdots, 2\mu^{k'}q^{f-1}\} for 0\leq k'\leq 2e-1 , and C_{5\mu^{k}} = \{5\mu^{k}, 5\mu^{k}q, \cdots, 5\mu^{k}q^{f-1}\} for 0\leq k\leq e-1 .

    (3) If q\equiv 4 \pmod 5 and f is odd, we have that all the distinct q -cyclotomic cosets modulo 5\ell are given by C_{0} = \{0\} , C_{\ell} = \{\ell, \ell q\} , C_{2\ell} = \{2\ell, 2\ell q\} , C_{\mu^{k}} = \{\mu^{k}, \mu^{k}q, \cdots, \mu^{k}q^{2f-1}\} , C_{2\mu^{k}} = \{2\mu^{k}, 2\mu^{k}q, \cdots, 2\mu^{k}q^{2f-1}\} , and C_{5\mu^{k}} = \{5\mu^{k}, 5\mu^{k}q, \cdots, 5\mu^{k}q^{f-1}\} for 0\leq k\leq e-1 .

    (4) If q\equiv 2 or 3 \pmod 5 and 4\mid f , we have that all the distinct q -cyclotomic cosets modulo 5\ell are given by C_{0} = \{0\} , C_{\ell} = \{\ell, \ell q, \ell q^{2}, \ell q^{3}\} , C_{\mu^{k'}} = \{\mu_{k'}, \mu^{k'}q, \cdots, \mu^{k'}q^{f-1}\} for 0\leq k'\leq 4e-1 , and C_{5\mu^{k}} = \{5\mu^{k}, 5\mu^{k}q, \cdots, 5\mu^{k}q^{f-1}\} for 0\leq k\leq e-1 .

    (5) If q\equiv 2 or 3 \pmod 5 and 2\mid f but 4\nmid f , we have that all the distinct q -cyclotomic cosets modulo 5\ell are given by C_{0} = \{0\} , C_{\ell} = \{\ell, \ell q, \ell q^{2}, lq^{3}\} , C_{\mu^{k'}} = \{\mu_{k'}, \mu^{k'}q, \cdots, \mu^{k'}q^{2f-1}\} for 0\leq k'\leq 2e-1 , and C_{5\mu^{k}} = \{5\mu^{k}, 5\mu^{k}q, \cdots, 5\mu^{k}q^{f-1}\} for 0\leq k\leq e-1 .

    (6) If q\equiv 2 or 3 \pmod 5 and f is odd, we have that all the distinct q -cyclotomic cosets modulo 5\ell are given by C_{0} = \{0\} , C_{\ell} = \{\ell, \ell q, \ell q^{2}, \ell q^{3}\} , C_{\mu^{k}} = \{\mu_{k}, \mu^{k}q, \cdots, \mu^{k}q^{4f-1}\} , and C_{5\mu^{k}} = \{5\mu^{k}, 5\mu^{k}q, \cdots, 5\mu^{k}q^{f-1}\} for 0\leq k\leq e-1 .

    Proof. The methods to prove the above 6 situations are similar, and we will give the proof of the second situation as a instance. First since \mu is a fixed primitive root modulo l such that \mu\equiv 1 \pmod 5 , it is trivial to verify that C_{0} , C_{\ell} , C_{2\ell} , C_{\mu^{k'}} , C_{2\mu^{k'}} for 0\leq k'\leq 2e-1 and C_{5\mu^{k}} for 0\leq k\leq e-1 are q -cyclotomic cosets modulo 5\ell . And then we claim that all these cosets are all distinct. If we have that a_{1}\mu^{k_{1}}\equiv a_{2}\mu^{k_{2}}q^{j} , where a_{1} , a_{2} , k_{1} , k_{2} and j satisfy the definitions in (2). Since

    \gcd(a_{1}, 5\ell ) = \gcd(a_{1}\mu^{k_{1}}, 5\ell ) = \gcd(a_{2}\mu^{k_{2}}q^{j}, 5\ell ) = \gcd(a_{2}, 5\ell ),

    we have that either a_{1} = a_{2} or a_{1}\neq a_{2} and both a_{1} and a_{2} are not equal to 5 . We divide the proof into 2 subcases.

    Subcase 1. If a_{1} = a_{2} , we have that \mu^{k_{1}-k_{2}}\equiv q^{j}\pmod {\ell} and \mu^{(k_{1}-k_{2})f}\equiv 1\pmod {\ell} , therefore \phi(\ell)\mid (k_{1}-k_{2})f and \dfrac{\phi(\ell)}{f}\mid (k_{1}-k_{2}) , which indicates that k_{1} = k_{2} .

    Subcase 2. If a_{1}\neq a_{2} and none of them is equal to 5 , we have that a_{1}a_{2}^{-1}\equiv \mu^{k_{2}-k_{1}}q^{j}\pmod {5\ell} , but notice that a_{1}a_{2}^{-1}\equiv \pm2 \pmod 5 and \mu^{k_{2}-k_{1}}q^{j}\equiv \pm1 \pmod 5 , which is a contradiction. Hence the given cosets are all distinct, and we only need to prove they are all the q -cyclotomic cosets to complete the proof.

    Notice that

    \vert C_{0}\vert+\vert C_{\ell}\vert+\vert C_{2\ell}\vert+\sum\limits_{k' = 0}^{2e-1}\vert C_{\mu^{k'}}\vert+\sum\limits_{k' = 0}^{2e-1}\vert C_{2\mu^{k'}}\vert+\sum\limits_{k = 0}^{e-1}\vert C_{5\mu^{k}}\vert = 5+2ef+2ef+ef = 5(ef+1) = 5(\phi(\ell)+1) = 5\ell.

    Therefore the conclusion holds.

    Theorem 6.1. The irreducible factorization of x^{5\ell }-1 over \mathbb{F}_q is given as follows.

    (1) If q\equiv 1 \pmod 5 , then

    x^{5\ell }-1 = C_{0}(x)C_{\ell}(x)C_{2\ell}(x)C_{3\ell}(x)C_{4\ell}(x)\prod\limits_{a\in R}\prod\limits_{k = 0}^{e-1}C_{a\mu^{k}}(x),

    where R = {1, 2, 3, 4, 5} .

    (2) If q\equiv 4 \pmod 5 and f is even, then

    x^{5\ell }-1 = C_{0}(x)C_{\ell}(x)C_{2\ell}(x)\prod\limits_{k' = 0}^{2e-1}C_{\mu^{k'}}(x)C_{2\mu^{k'}}(x)\prod\limits_{k = 0}^{e-1}C_{5\mu^{k}}(x),

    (3) If q\equiv 4 \pmod 5 and f is odd, then

    x^{5\ell }-1 = C_{0}(x)C_{\ell}(x)C_{2\ell}(x)\prod\limits_{k = 0}^{e-1}C_{\mu^{k}}(x)C_{2\mu^{k}}(x)C_{5\mu^{k}}(x),

    (4) If q\equiv 2 or 3 \pmod 5 and 4\mid f , then

    x^{5\ell }-1 = C_{0}(x)C_{\ell}(x)\prod\limits_{k' = 0}^{4e-1}C_{\mu^{k'}}(x)\prod\limits_{k = 0}^{e-1}C_{5\mu^{k}}(x),

    (5) If q\equiv 2 or 3 \pmod 5 and 2\mid f but 4\nmid f , then

    x^{5\ell }-1 = C_{0}(x)C_{\ell}(x)\prod\limits_{k' = 0}^{2e-1}C_{\mu^{k'}}(x)\prod\limits_{k = 0}^{e-1}C_{5\mu^{k}}(x),

    (6) If q\equiv 2 or 3 \pmod 5 and f is odd, then

    x^{5\ell }-1 = C_{0}(x)C_{\ell}(x)\prod\limits_{k = 0}^{e-1}C_{\mu^{k}}(x)C_{5\mu^{k}}(x),

    With the irreducible factorization of x^{5\ell }-1 , we can straightly follow the process given in Section 4 to calculate all the constacyclic codes of length 5\ell p^{s} over \mathbb{F}_{q} . We list the result as follow.

    Theorem 6.2. Assume that \gcd(q-1, 5\ell p^{s}) = 1 , then \lambda -constacyclic codes C of length 5\ell p^{s} over \mathbb{F}_q are equivalent to the cyclic codes, i.e., for any \lambda\in \mathbb{F}_{q}^* , there exists a unique element a\in \mathbb{F}_{q}^* such that a^{5\ell p^{s}}\lambda = 1 . Furthermore, the irreducible factorization of x^{5\ell p^{s}}-\lambda over \mathbb{F}_q is given by

    (1) If q\equiv 4 \pmod 5 and f is even, then

    x^{5\ell p^{s}}-\lambda = \widehat{C}_{0}(ax)^{p^{s}}\widehat{C}_{\ell}(ax)^{p^{s}}\widehat{C}_{2\ell}(ax)^{p^{s}}\prod\limits_{k' = 0}^{2e-1}\widehat{C}_{\mu^{k'}} (ax)^{p^{s}}\widehat{C}_{2\mu^{k'}}(ax)^{p^{s}}\prod\limits_{k = 0}^{e-1}\widehat{C}_{5\mu^{k}}(ax)^{p^{s}},

    Therefore we have that

    C = \left(\widehat{C}_{0}(ax)^{\varepsilon_{1}}\widehat{C}_{\ell}(ax)^{\varepsilon_{2}}\widehat{C}_{2\ell}(ax)^{\varepsilon_{3}}\prod\limits_{k' = 0}^{2e-1}\widehat{C}_{\mu^{k'}} (ax)^{\tau_{k^{'}}}\widehat{C}_{2\mu^{k'}}(ax)^{\nu_{k^{'}}}\prod\limits_{k = 0}^{e-1}\widehat{C}_{5\mu^{k}}(ax)^{\rho_{k}}\right),

    and

    \begin{eqnarray*} C^{\bot}& = &\left(\widehat{C}_{0}(a^{-1}x)^{p^{s}-\varepsilon_{1}}\widehat{C}_{-\ell}(a^{-1}x)^{p^{s}-\varepsilon_{2}}\widehat{C}_{-2\ell}(a^{-1}x)^{p^{s}-\varepsilon_{3}}\right.\\ &&\times\left.\prod\limits_{k' = 0}^{2e-1}\widehat{C}_{-\mu^{k'}} (a^{-1}x)^{p^{s}-\tau_{k^{'}}}\widehat{C}_{-2\mu^{k'}}(a^{-1}x)^{p^{s}-\nu_{k^{'}}}\prod\limits_{k = 0}^{e-1}\widehat{C}_{-5\mu^{k}}(a^{-1}x)^{p^{s}-\rho_{k}}\right), \end{eqnarray*}

    where 0\leq \varepsilon_{1}, \varepsilon_{2}, \varepsilon_{3}, \tau_{k^{'}}, \nu_{k^{'}}, \rho_{k}\leq p^{s} , for any k^{'} = 0, 1, \cdots, 2e-1 , and k = 0, 1, \cdots, e-1 .

    (2) If q\equiv 4 \pmod 5 and f is odd, then

    x^{5\ell p^{s}}-\lambda = \widehat{C}_{0}(ax)^{p^{s}}\widehat{C}_{\ell}(ax)^{p^{s}}\widehat{C}_{2\ell}(ax)^{p^{s}}\prod\limits_{k = 0}^{e-1}\widehat{C}_{\mu^{k}}(ax)^{p^{s}}\widehat{C}_{2\mu^{k}} (ax)^{p^{s}}\widehat{C}_{5\mu^{k}}(ax)^{p^{s}}.

    Therefore we have that

    C = \left(\widehat{C}_{0}(ax)^{\varepsilon_{1}}\widehat{C}_{\ell}(ax)^{\varepsilon_{2}}\widehat{C}_{2\ell}(ax)^{\varepsilon_{3}}\prod\limits_{k = 0}^{e-1}\widehat{C}_{\mu^{k}}(ax)^{\tau_{k}}\widehat{C}_{2\mu^{k}} (ax)^{\nu_{k}}\widehat{C}_{5\mu^{k}}(ax)^{\rho_{k}}\right),

    and

    \begin{eqnarray*} C^{\bot}& = &\left(\widehat{C}_{0}(a^{-1}x)^{p^{s}-\varepsilon_{1}}\widehat{C}_{-\ell}(a^{-1}x)^{p^{s}-\varepsilon_{2}}\widehat{C}_{-2\ell}(a^{-1}x)^{p^{s}-\varepsilon_{3}}\right.\\ &&\times\left.\prod\limits_{k = 0}^{e-1}\widehat{C}_{-\mu^{k}}(a^{-1}x)^{p^{s}-\tau_{k}}\widehat{C}_{-2\mu^{k}} (a^{-1}x)^{p^{s}-\nu_{k}}\widehat{C}_{-5\mu^{k}}(a^{-1}x)^{p^{s}-\rho_{k}}\right), \end{eqnarray*}

    where 0\leq \varepsilon_{1}, \varepsilon_{2}, \varepsilon_{3}, \tau_{k}, \nu_{k}, \rho_{k}\leq p^{s} , for k = 0, 1, \cdots, e-1 .

    (3) If q\equiv 2 or 3 \pmod 5 and 4\mid f , then

    x^{5\ell p^{s}}-\lambda = \widehat{C}_{0}(ax)^{p^{s}}\widehat{C}_{\ell}(ax)^{p^{s}}\prod\limits_{k' = 0}^{4e-1}\widehat{C}_{\mu^{k'}}(ax)^{p^{s}}\prod\limits_{k = 0}^{e-1}\widehat{C}_{5\mu^{k}}(ax)^{p^{s}}.

    Therefore we have that

    C = \left(\widehat{C}_{0}(ax)^{\varepsilon_{1}}\widehat{C}_{\ell}(ax)^{\varepsilon_{2}}\prod\limits_{k' = 0}^{4e-1}\widehat{C}_{\mu^{k'}}(ax)^{\tau_{k^{'}}}\prod\limits_{k = 0}^{e-1}\widehat{C}_{5\mu^{k}}(ax)^{\nu_{k}}\right),

    and

    C^{\bot} = \left(\widehat{C}_{0}(a^{-1}x)^{p^{s}-\varepsilon_{1}}\widehat{C}_{-\ell}(a^{-1}x)^{p^{s}-\varepsilon_{2}}\prod\limits_{k' = 0}^{4e-1}\widehat{C}_{-\mu^{k'}}(a^{-1}x)^{p^{s}-\tau_{k^{'}}}\prod\limits_{k = 0}^{e-1}\widehat{C}_{-5\mu^{k}}(a^{-1}x)^{p^{s}-\nu_{k}}\right),

    where 0\leq \varepsilon_{1}, \varepsilon_{2}, \tau_{k^{'}}, \nu_{k}\leq p^{s} , for k^{'} = 0, 1, \cdots, 4e-1 , and k = 0, 1, \cdots, e-1 .

    (4) If q\equiv 2 or 3 \pmod 5 and 2\mid f but 4\nmid f , then

    x^{5\ell p^{s}}-\lambda = \widehat{C}_{0}(ax)^{p^{s}}\widehat{C}_{\ell}(ax)^{p^{s}}\prod\limits_{k' = 0}^{2e-1}\widehat{C}_{\mu^{k'}}(ax)^{p^{s}}\prod\limits_{k = 0}^{e-1}\widehat{C}_{5\mu^{k}}(ax)^{p^{s}}.

    Therefore we have that

    C = \left(\widehat{C}_{0}(ax)^{\varepsilon_{1}}\widehat{C}_{\ell}(ax)^{\varepsilon_{2}}\prod\limits_{k' = 0}^{2e-1}\widehat{C}_{\mu^{k'}}(ax)^{\tau_{k^{'}}}\prod\limits_{k = 0}^{e-1}\widehat{C}_{5\mu^{k}}(ax)^{\nu_{k}}\right),

    and

    C^{\bot} = \left(\widehat{C}_{0}(a^{-1}x)^{p^{s}-\varepsilon_{1}}\widehat{C}_{-\ell}(a^{-1}x)^{p^{s}-\varepsilon_{2}}\prod\limits_{k' = 0}^{2e-1}\widehat{C}_{-\mu^{k'}}(a^{-1}x)^{p^{s}-\tau_{k^{'}}}\prod\limits_{k = 0}^{e-1}\widehat{C}_{-5\mu^{k}}(a^{-1}x)^{p^{s}-\nu_{k}}\right),

    where 0\leq \varepsilon_{1}, \varepsilon_{2}, \tau_{k^{'}}, \nu_{k}\leq p^{s} , for k^{'} = 0, 1, \cdots, 2e-1 , and k = 0, 1, \cdots, e-1 .

    (5) If q\equiv 2 or 3 \pmod 5 and f is odd, then

    x^{5\ell p^{s}}-\lambda = \widehat{C}_{0}(ax)^{p^{s}}\widehat{C}_{\ell}(ax)^{p^{s}}\prod\limits_{k = 0}^{e-1}\widehat{C}_{\mu^{k}}(ax)^{p^{s}}\widehat{C}_{5\mu^{k}}(ax)^{p^{s}}.

    Therefore we have that

    C = \left(\widehat{C}_{0}(ax)^{\varepsilon_{1}}\widehat{C}_{\ell}(ax)^{\varepsilon_{2}}\prod\limits_{k = 0}^{e-1}\widehat{C}_{\mu^{k}}(ax)^{\tau_{k}}\widehat{C}_{5\mu^{k}}(ax)^{\nu_{k}}\right),

    and

    C^{\bot} = \left(\widehat{C}_{0}(a^{-1}x)^{p^{s}-\varepsilon_{1}}\widehat{C}_{-\ell}(a^{-1}x)^{p^{s}-\varepsilon_{2}}\prod\limits_{k = 0}^{e-1}\widehat{C}_{-\mu^{k}}(a^{-1}x)^{p^{s}-\tau_{k}}\widehat{C}_{-5\mu^{k}}(a^{-1}x)^{p^{s}-\nu_{k}}\right),

    where 0\leq \varepsilon_{1}, \varepsilon_{2}, \tau_{k}, \nu_{k}\leq p^{s} , for k = 0, 1, \cdots, e-1 .

    Theorem 6.3. Assume that \gcd(q-1, 5\ell p^{s}) = 5\ell , then \mathbb{F}_{q}^* = \langle\xi\rangle = \langle\xi^{5\ell }\rangle\cup \langle\xi^{5\ell }\rangle\xi^{p^{s}}\cup \cdots\cup \langle\xi^{5\ell }\rangle\xi^{p^{s}(5\ell -1)} . For any \lambda\in \mathbb{F}_{q}^* , there exists an element a\in \mathbb{F}_{q}^* such that a^{5\ell p^{s}}\lambda = \xi^{j\cdot p^{s}} , where 0\leq j\leq 5\ell -1 . Then j can be written as j = y\cdot 5^{v_{1}}\ell^{v_{2}} , where v_{1} = \min\{1, v_{5}(j)\} and v_{2} = \min\{1, v_{\ell}(j)\} . And

    \begin{eqnarray*} x^{n}-\lambda& = &(x^{5^{1-v_{1}}\ell^{1-v_{2}}}-a^{-5^{1-v_{1}}\ell^{1-v_{2}}}\xi^{y})^{p^{s}}(x^{5^{1-v_{1}}\ell^{1-v_{2}}}-a^{-5^{1-v_{1}}\ell^{1-v_{2}}}\delta\xi^{y})^{p^{s}}\\ &&\cdots(x^{5^{1-v_{1}}\ell^{1-v_{2}}}-a^{-5^{1-v_{1}}\ell^{1-v_{2}}}\delta^{5^{v_{1}}\ell^{v_{2}}-1}\xi^{y})^{p^{s}} \end{eqnarray*}

    gives the irreducible factorization of x^{5\ell p^{s}}-\lambda over \mathbb{F}_{q} . Moreover, all the \lambda -constacyclic codes of length 5lp^{s} and their dual codes are given by

    \begin{eqnarray*} C& = &\left((x^{5^{1-v_{1}}\ell^{1-v_{2}}}-a^{-5^{1-v_{1}}\ell^{1-v_{2}}}\xi^{y})^{\varepsilon_{1}}(x^{5^{1-v_{1}}\ell^{1-v_{2}}}-a^{-5^{1-v_{1}}\ell^{1-v_{2}}}\delta\xi^{y})^{\varepsilon_{2}}\right.\\ &&\left.\cdots(x^{5^{1-v_{1}}\ell^{1-v_{2}}}-a^{-5^{1-v_{1}}\ell^{1-v_{2}}}\delta^{5^{v_{1}}\ell^{v_{2}}-1}\xi^{y})^{\varepsilon_{5^{v_{1}}\ell^{v_{2}}}}\right), \end{eqnarray*}

    and

    \begin{eqnarray*} C^{\bot}& = &\left((x^{5^{1-v_{1}}\ell^{1-v_{2}}}-a^{5^{1-v_{1}}\ell^{1-v_{2}}}\xi^{-y})^{p^{s}-\varepsilon_{1}}(x^{5^{1-v_{1}}\ell^{1-v_{2}}}-a^{5^{1-v_{1}}\ell^{1-v_{2}}}\delta^{-1}\xi^{-y})^{p^{s}-\varepsilon_{2}}\right.\\ &&\left.\cdots(x^{5^{1-v_{1}}\ell^{1-v_{2}}}-a^{5^{1-v_{1}}\ell^{1-v_{2}}}\delta^{1-5^{v_{1}}\ell^{v_{2}}}\xi^{-y})^{p^{s}-\varepsilon_{5^{v_{1}}\ell^{v_{2}}}}\right), \end{eqnarray*}

    where 0\leq \varepsilon_{1}, \varepsilon_{2}, \cdots, \varepsilon_{5^{v_{1}}\ell^{v_{2}}}\leq p^{s} .

    Theorem 6.4. Assume that \gcd(q-1, 5\ell p^{s}) = 5 , then for any 0\leq j\leq 4 , there exists an element a\in \mathbb{F}_{q^{f}}* such that a^{5\ell p^{s}}\xi^{j\cdot p^{s}} = \zeta^{j'\cdot p^{s}} . Moreover, each irreducible factor of x^{5\ell}-\xi^{j} over \mathbb{F}_{q} is of the form

    \begin{eqnarray*} &&(x^{5^{1-v_{1}}\ell^{1-v_{2}}}-a^{-5^{1-v_{1}}\ell^{1-v_{2}}}\delta^{i}\zeta^{y'})(x^{5^{1-v_{1}}\ell^{1-v_{2}}}-a^{-5^{1-v_{1}}\ell^{1-v_{2}}\cdot q}\delta^{iq}\zeta^{y'q})\\ &&\cdots(x^{5^{1-v_{1}}\ell^{1-v_{2}}}-a^{-5^{1-v_{1}}\ell^{1-v_{2}}\cdot q^{z_{i}-1}}\delta^{iq^{z_{i}-1}}\zeta^{y'q^{z_{i}-1}}), \end{eqnarray*}

    where j' = y'5^{v_{1}}\ell^{v_{2}} , v_{1} = \min\{1, v_{5}(j')\} , v_{2} = \min\{1, v_{\ell}(j')\} , and z_{i} is the least positive integer such that a^{-q^{z_{i}}5^{1-v_{1}}\ell^{1-v_{2}}}\delta^{iq^{z_{i}}}\zeta^{y'q^{z_{i}}} = a^{5^{1-v_{1}}\ell^{1-v_{2}}}\delta^{i}\zeta^{y'} .

    For any 0\leq i, i^{'}\leq 5^{v_{1}}\ell^{v_{2}}-1 , we define a relation \sim to be such that i\sim i^{'} if and only if a^{-q^{m}5^{1-v_{1}}\ell^{1-v_{2}}}\delta^{iq^{m}}\zeta^{y'q^{m}} = a^{5^{1-v_{1}}\ell^{1-v_{2}}}\delta^{i^{'}}\zeta^{y'} for some nonnegative integers m . It is obvious to see that \sim is an equivalence relation. Assume that S is a complete system of equivalence class representatives of \{0, 1, \cdots, 5^{v_{1}}\ell^{v_{2}}-1\} relative to this relation \sim . For any i\in S we denote the irreducible polynomial

    \begin{eqnarray*} &&(x^{5^{1-v_{1}}\ell^{1-v_{2}}}-a^{-5^{1-v_{1}}\ell^{1-v_{2}}}\delta^{i}\zeta^{y'})(x^{5^{1-v_{1}}\ell^{1-v_{2}}}-a^{-5^{1-v_{1}}\ell^{1-v_{2}}\cdot q}\delta^{iq}\zeta^{y'q})\\ &&\cdots(x^{5^{1-v_{1}}\ell^{1-v_{2}}}-a^{-5^{1-v_{1}}\ell^{1-v_{2}}\cdot q^{z_{i}-1}}\delta^{iq^{z_{i}-1}}\zeta^{y'q^{z_{i}-1}}), \end{eqnarray*}

    by M_{i}(x) , and denote

    \begin{eqnarray*} &&(x^{5^{1-v_{1}}\ell^{1-v_{2}}}-a^{5^{1-v_{1}}\ell^{1-v_{2}}}\delta^{-i}\zeta^{-y'})(x^{5^{1-v_{1}}\ell^{1-v_{2}}}-a^{5^{1-v_{1}}\ell^{1-v_{2}}\cdot q}\delta^{-iq}\zeta^{-y'q})\\ &&\cdots(x^{5^{1-v_{1}}\ell^{1-v_{2}}}-a^{5^{1-v_{1}}\ell^{1-v_{2}}\cdot q^{z_{i}-1}}\delta^{-iq^{z_{i}-1}}\zeta^{-y'q^{z_{i}-1}}), \end{eqnarray*}

    by M_{i}^{'}(x) . Then we have the following corollary.

    Corollary 6.1. Assume that \gcd(q-1, 5\ell p^{s}) = 5 . For any 0\leq j\leq 4 , there exists an element a\in \mathbb{F}_{q^{f}}* such that a^{5\ell p^{s}}\xi^{j\cdot p^{s}} = \zeta^{j'\cdot p^{s}} . Then

    x^{5\ell p^{s}}-\xi^{j p^{s}} = \prod\limits_{i\in S}M_{i}(x)^{p^{s}}

    gives the irreducible factorization of x^{5\ell p^{s}}-\xi^{j p^{s}} over \mathbb{F}_q . Furthermore we have that

    C = \left(\prod\limits_{i\in X}M_{i}(x)^{\varepsilon_{i}}\right),

    and

    C^{\bot} = \left(\prod\limits_{i\in X}M_{i}^{'}(x)^{p^{s}-\varepsilon_{i}}\right),

    where 0\leq \varepsilon_{i}\leq p^{s} , for i\in X .

    Theorem 6.5. Assume that \gcd(q-1, 5\ell p^{s}) = \ell , then

    (1) If q\equiv 4 \pmod 5 , for any 0\leq j\leq \ell-1 , the following equations

    j'\equiv 2j\pmod{\ell}\;\mathit{\text{ and }}\;j'\equiv 0 \pmod 5

    have a unique solution j' up to modulo 5\ell . Moreover, each irreducible facotor of x^{5\ell}-\xi^{j} over \mathbb{F}_{q} is of the form

    \begin{eqnarray*} &&(x^{5^{1-v_{1}}\ell^{1-v_{2}}}-a^{-5^{1-v_{1}}\ell^{1-v_{2}}}\delta^{i}\zeta^{y'})(x^{5^{1-v_{1}}\ell^{1-v_{2}}}-a^{-5^{1-v_{1}}\ell^{1-v_{2}}\cdot q}\delta^{iq}\zeta^{y'q})\\ &&\cdots(x^{5^{1-v_{1}}\ell^{1-v_{2}}}-a^{-5^{1-v_{1}}\ell^{1-v_{2}}\cdot q^{z_{i}-1}}\delta^{iq^{z_{i}-1}}\zeta^{y'q^{z_{i}-1}}), \end{eqnarray*}

    where j' = y'5^{v_{1}}\ell^{v_{2}} , v_{1} = \min\{1, v_{5}(j')\} , v_{2} = \min\{1, v_{\ell}(j')\} , and z_{i} is the least positive integer such that a^{-q^{z_{i}}5^{1-v_{1}}\ell^{1-v_{2}}}\delta^{iq^{z_{i}}}\zeta^{y'q^{z_{i}}} = a^{5^{1-v_{1}}\ell^{1-v_{2}}}\delta^{i}\zeta^{y'} .

    (2) If q\equiv 2, 3 \pmod 5 , for any 0\leq j\leq \ell-1 , the following equations

    j'\equiv 4j \pmod{\ell}
    j'\equiv 0 \pmod 5

    have a unique solution j' up to modulo 5\ell . Moreover, each irreducible facotor of x^{5\ell}-\xi^{j} over \mathbb{F}_{q} is of the form

    \begin{eqnarray*} &&(x^{5^{1-v_{1}}\ell^{1-v_{2}}}-a^{-5^{1-v_{1}}\ell^{1-v_{2}}}\delta^{i}\zeta^{y'})(x^{5^{1-v_{1}}\ell^{1-v_{2}}}-a^{-5^{1-v_{1}}\ell^{1-v_{2}}\cdot q}\delta^{iq}\zeta^{y'q})\\ &&\cdots(x^{5^{1-v_{1}}\ell^{1-v_{2}}}-a^{-5^{1-v_{1}}\ell^{1-v_{2}}\cdot q^{z_{i}-1}}\delta^{iq^{z_{i}-1}}\zeta^{y'q^{z_{i}-1}}), \end{eqnarray*}

    where j' = y'5^{v_{1}}\ell^{v_{2}} , v_{1} = min{1, v_{5}(j')} , v_{2} = min{1, v_{\ell}(j')} , and z_{i} is the least positive integer such that a^{-q^{z_{i}}5^{1-v_{1}}\ell^{1-v_{2}}}\delta^{iq^{z_{i}}}\zeta^{y'q^{z_{i}}} = a^{5^{1-v_{1}}\ell^{1-v_{2}}}\delta^{i}\zeta^{y'} .

    For any 0\leq i, i^{'}\leq 5^{v_{1}}\ell^{v_{2}}-1 , we define a relation \sim to be such that i\sim i^{'} if and only if a^{-q^{m}5^{1-v_{1}}\ell^{1-v_{2}}}\delta^{iq^{m}}\zeta^{y'q^{m}} = a^{5^{1-v_{1}}\ell^{1-v_{2}}}\delta^{i^{'}}\zeta^{y'} for some nonnegative integer m . It is obvious to see that \sim is an equivalence relation. Assume that S is a complete system of equivalence class representatives of \{0, 1, \cdots, 5^{v_{1}}\ell^{v_{2}}-1\} relative to this relation \sim . For any i\in S we denote the irreducible polynomial

    \begin{eqnarray*} &&(x^{5^{1-v_{1}}\ell^{1-v_{2}}}-a^{-5^{1-v_{1}}\ell^{1-v_{2}}}\delta^{i}\zeta^{y'})(x^{5^{1-v_{1}}\ell^{1-v_{2}}}-a^{-5^{1-v_{1}}\ell^{1-v_{2}}\cdot q}\delta^{iq}\zeta^{y'q})\\ &&\cdots(x^{5^{1-v_{1}}\ell^{1-v_{2}}}-a^{-5^{1-v_{1}}\ell^{1-v_{2}}\cdot q^{z_{i}-1}}\delta^{iq^{z_{i}-1}}\zeta^{y'q^{z_{i}-1}}), \end{eqnarray*}

    by M_{i}(x) , and denote

    \begin{eqnarray*} &&(x^{5^{1-v_{1}}\ell^{1-v_{2}}}-a^{5^{1-v_{1}}\ell^{1-v_{2}}}\delta^{-i}\zeta^{-y'})(x^{5^{1-v_{1}}\ell^{1-v_{2}}}-a^{5^{1-v_{1}}\ell^{1-v_{2}}\cdot q}\delta^{-iq}\zeta^{-y'q})\\ &&\cdots(x^{5^{1-v_{1}}\ell^{1-v_{2}}}-a^{5^{1-v_{1}}\ell^{1-v_{2}}\cdot q^{z_{i}-1}}\delta^{-iq^{z_{i}-1}}\zeta^{-y'q^{z_{i}-1}}), \end{eqnarray*}

    by M_{i}^{'}(x) .

    Corollary 6.2. Assume that \gcd(q-1, 5\ell p^{s}) = \ell , then

    (1) If q\equiv 4 \pmod 5 , and j, j^{'} is defined as in the first case of Theorem 5.1, then

    x^{5\ell p^{s}}-\xi^{j p^{s}} = \prod\limits_{i\in X}M_{i}(x)^{p^{s}}

    gives the irreducible factorization of x^{5\ell p^{s}}-\xi^{j p^{s}} over \mathbb{F}_q . Furthermore we have that

    C = \left(\prod\limits_{i\in X}M_{i}(x)^{\varepsilon_{i}}\right),

    and

    C^{\bot} = \left(\prod\limits_{i\in X}M_{i}^{'}(x)^{p^{s}-\varepsilon_{i}}\right),

    where 0\leq \varepsilon_{i}\leq p^{s} , for i\in X .

    (2) If q\equiv 2, 3 \pmod 5 , and j, j^{'} is defined as in the second case of Theorem 5.1, then

    x^{5\ell p^{s}}-\xi^{j p^{s}} = \prod\limits_{i\in X}M_{i}(x)^{p^{s}}

    gives the irreducible factorization of x^{5\ell p^{s}}-\xi^{j p^{s}} over \mathbb{F}_q . Furthermore we have that

    C = \left(\prod\limits_{i\in X}M_{i}(x)^{\varepsilon_{i}}\right),

    and

    C^{\bot} = \left(\prod\limits_{i\in X}M_{i}^{'}(x)^{p^{s}-\varepsilon_{i}}\right),

    where 0\leq \varepsilon_{i}\leq p^{s} , for i\in X .

    Finally we give all the self-dual constacylic codes of length 5\ell p^{s} as the end of this section. Since self-dual cyclic codes of length N over \mathbb{F}_q exists if and only if N is even and the characteristic of \mathbb{F}_q is p = 2 , as in the general case, we only consider the case of self-dual cyclic codes of length 5\cdot 2^{s}\ell over \mathbb{F}_{2^{m}} .

    Lemma 6.2. Assume that q\equiv 1 \pmod 5 . For the q -cyclotomic cosets, one of the following holds.

    (1) If f = \mathrm{ord}_{\ell}(q) is even, we have that

    C_{0}^{*} = C_{0}, \ C_{\ell}^{*} = C_{-\ell}, \ C_{2\ell}^{*} = C_{-2\ell}, \ C_{\mu^{k}}^{*} = C_{-\mu^{k}}, \ C_{2\mu^{k}}^{*} = C_{-2\mu^{k}}, \ C_{5\mu^{k}}^{*} = C_{5\mu^{k}},

    where 0\leq k\leq e-1 .

    (2) If f = \mathrm{ord}_{\ell}(q) is odd, we have that

    C_{0}^{*} = C_{0}, \ C_{\ell}^{*} = C_{-\ell}, \ C_{2\ell}^{*} = C_{-2\ell}, \ C_{\mu^{k}}^{*} = C_{-\mu^{k}}, \ C_{2\mu^{k}}^{*} = C_{-2\mu^{k}}, \ C_{5\mu^{k^{'}}}^{*} = C_{-5\mu^{k^{'}}},

    where \{C_{5\mu^{k}}\} = \{C_{5\mu^{k^{'}}}\}\bigcup \{C_{-5\mu^{k^{'}}}\} , and 0\leq k\leq e-1 , 0\leq k^{'}\leq \dfrac{e}{2}-1 .

    Proof.

    (1) By the definition of reciprocal coset, it is clear that C_{0}^{*} = C_{0}, \ C_{\ell}^{*} = C_{-\ell}, \ C_{2\ell}^{*} = C_{-2\ell}, \ C_{\mu^{k}}^{*} = C_{-\mu^{k}}, \ C_{2\mu^{k}}^{*} = C_{-2\mu^{k}} , thus it remains to prove C_{5\mu^{k}}^{*} = C_{5\mu^{k}} . Let t = \frac{f}{2} . Since f = \mathrm{ord}_{\ell}(q) , it is trivial to see that q^{t}\equiv -1 \pmod \ell , and therefore we have that -5\mu^{k}\equiv 5\mu^{k}q^{t} \pmod {5\ell} . It follows immediately that C_{5\mu^{k}}^{*} = C_{5\mu^{k}} , for 0\leq k\leq e-1 .

    (2) As in the first case, the conclusions that C_{0}^{*} = C_{0}, \ C_{\ell}^{*} = C_{-\ell}, \ C_{2\ell}^{*} = C_{-2\ell}, \ C_{\mu^{k}}^{*} = C_{-\mu^{k}}, \ C_{2\mu^{k}}^{*} = C_{-2\mu^{k}} are clear, and now we prove that C_{5\mu^{k^{'}}}^{*} = C_{-5\mu^{k^{'}}} . To see this, we claim that for any 0\leq k_{1}^{'}, k_{2}^{'}\leq \frac{e}{2}-1 , C_{5\mu^{k_{1}^{'}}}\neq C_{-5\mu^{k_{2}^{'}}} , and \{C_{5\mu^{k}}\} = \{C_{5\mu^{k^{'}}}\}\bigcup \{C_{-5\mu^{k^{'}}}\} . Assume that C_{5\mu^{k_{1}^{'}}} = C_{-5\mu^{k_{2}^{'}}} for some 0\leq k_{1}^{'}, k_{2}^{'}\leq \frac{e}{2}-1 , then we have that 5\mu^{k_{1}^{'}}\equiv -5\mu^{k_{2}^{'}}q^{j} \pmod {5\ell} for some 0\leq j\leq f-1 , which indicates that -\mu^{k_{1}^{'}-k_{2}^{'}}\equiv q^{j} \pmod \ell . Notice that f is odd, therefore we have that -\mu^{f(k_{1}^{'}-k_{2}^{'})}\equiv q^{jf} \equiv 1 \pmod \ell and \mu^{f(k_{1}^{'}-k_{2}^{'})}\equiv -1 \pmod \ell . It follows that \mu^{2f(k_{1}^{'}-k_{2}^{'})}\equiv 1 \pmod \ell , hence \phi(\ell)\mid 2f(k_{1}^{'}-k_{2}^{'}) and \frac{e}{2}\mid k_{1}^{'}-k_{2}^{'} . Since by the condition we have 0\leq k_{1}^{'}, k_{2}^{'}\leq \frac{e}{2}-1 , we deduce that k_{1}^{'} = k_{2}^{'} . Then the equation 5\mu^{k_{1}^{'}}\equiv -5\mu^{k_{2}^{'}}q^{j} \pmod {5\ell} can be reduced to -1\equiv q^{j} \pmod \ell . However, notice that \mathrm{ord}_{\ell}(q) = f is odd, such a positive integer j cannot exist, which is a contradiction. According to this, we have that for any 0\leq k_{1}^{'}, k_{2}^{'}\leq \frac{e}{2}-1 , C_{5\mu^{k_{1}^{'}}}\neq C_{-5\mu^{k_{2}^{'}}} . By comparing the number of elements, it is trivial to verify that \{C_{5\mu^{k}}\} = \{C_{5\mu^{k^{'}}}\}\bigcup \{C_{-5\mu^{k^{'}}}\} holds. Then by the definition of reciprocal coset, one immediately get that C_{5\mu^{k^{'}}}^{*} = C_{-5\mu^{k^{'}}} .

    With the same method we can prove the results for the rest of cases. The proofs will be omitted.

    Lemma 6.3. Assume that q\equiv 4 \pmod 5 . For the q -cyclotomic cosets, one of the following holds.

    (1) If f = 2t is even, then

    (i) when t is even, we have that

    C_{0}^{*} = C_{0}, \ C_{\ell}^{*} = C_{\ell}, \ C_{2\ell}^{*} = C_{2\ell}, \ C_{\mu^{k}}^{*} = C_{-\mu^{k}}, \ C_{2\mu^{k}}^{*} = C_{-2\mu^{k}}, \ C_{5\mu^{k}}^{*} = C_{5\mu^{k}},

    where \{C_{\mu^{k^{'}}}\} = \{C_{\mu^{k}}\}\bigcup \{C_{-\mu^{k}}\} , \{C_{2\mu^{k^{'}}}\} = \{C_{2\mu^{k}}\}\bigcup \{C_{-2\mu^{k}}\} , for 0\leq k\leq e-1 , 0\leq k^{'}\leq 2e-1 .

    (ii) If t is odd, we have that

    C_{0}^{*} = C_{0}, \ C_{\ell}^{*} = C_{\ell}, \ C_{2\ell}^{*} = C_{2\ell}, \ C_{\mu^{k^{'}}}^{*} = C_{\mu^{k^{'}}}, \ C_{2\mu^{k^{'}}}^{*} = C_{2\mu^{k^{'}}}, \ C_{5\mu^{k}}^{*} = C_{5\mu^{k}},

    where 0\leq k\leq e-1 , 0\leq k^{'}\leq 2e-1 .

    (2) when f is odd, then

    C_{0}^{*} = C_{0}, \ C_{\ell}^{*} = C_{\ell}, \ C_{2\ell}^{*} = C_{2\ell}, \ C_{\mu^{k^{'}}}^{*} = C_{-\mu^{k^{'}}}, \ C_{2\mu^{k^{'}}}^{*} = C_{-2\mu^{k^{'}}}, \ C_{5\mu^{k^{'}}}^{*} = C_{-5\mu^{k^{'}}},

    where \{C_{\mu^{k}}\} = \{C_{\mu^{k^{'}}}\}\bigcup \{C_{-\mu^{k^{'}}}\} , \{C_{2\mu^{k}}\} = \{C_{2\mu^{k^{'}}}\}\bigcup \{C_{-2\mu^{k^{'}}}\} , \{C_{5\mu^{k}}\} = \{C_{5\mu^{k^{'}}}\}\bigcup \{C_{-5\mu^{k^{'}}}\} , for 0\leq k\leq e-1, 0\leq k^{'}\leq \frac{e}{2}-1 .

    Lemma 6.4. Assume that q\equiv 2 or 3 \pmod 5 . For the q -cyclotomic cosets, one of the following holds.

    (1) If 4\mid f . Let f = 4t , then

    (i) when t is even, we have that

    C_{0}^{*} = C_{0}, \ C_{\ell}^{*} = C_{\ell}, \ C_{\mu^{k^{''}}}^{*} = C_{-\mu^{k^{''}}}, \ C_{5\mu^{k}}^{*} = C_{5\mu^{k}},

    where \{C_{\mu^{k^{'}}}\} = \{C_{\mu^{k^{''}}}\}\bigcup \{C_{-\mu^{k^{''}}}\} , for 0\leq k\leq e-1 , 0\leq k^{''}\leq 2e-1 and 0\leq k^{'}\leq 4e-1 .

    (ii) If t is odd, we have that

    C_{0}^{*} = C_{0}, \ C_{\ell}^{*} = C_{\ell}, \ C_{\mu^{k^{'}}}^{*} = C_{\mu^{k^{'}}}, \ C_{5\mu^{k}}^{*} = C_{5\mu^{k}},

    where 0\leq k\leq e-1 , 0\leq k^{'}\leq 4e-1 .

    (2) If 2\mid f but 4\nmid f , then

    C_{0}^{*} = C_{0}, \ C_{\ell}^{*} = C_{\ell}, \ C_{\mu^{k}}^{*} = C_{-\mu^{k}}, \ C_{5\mu^{k}}^{*} = B_{5\mu^{k}},

    where \{C_{\mu^{k^{'}}}\} = \{C_{\mu^{k}}\}\bigcup \{C_{-\mu^{k}}\} , for 0\leq k\leq e-1 , 0\leq k^{'}\leq 2e-1 .

    (3) If f is odd, then

    C_{0}^{*} = C_{0}, \ C_{\ell}^{*} = C_{\ell}, \ C_{\mu^{k^{'}}}^{*} = C_{-\mu^{k^{'}}}, \ C_{5\mu^{k^{'}}}^{*} = C_{-5\mu^{k^{'}}},

    where \{C_{\mu^{k}}\} = \{C_{\mu^{k^{'}}}\}\bigcup \{C_{-\mu^{k^{'}}}\} , \{C_{5\mu^{k}}\} = \{C_{5\mu^{k^{'}}}\}\bigcup \{C_{-5\mu^{k^{'}}}\} , for 0\leq k^{'}\leq \frac{e}{2}-1 , 0\leq k\leq e-1 .

    From the above lemmas, we give all the self-dual cyclic codes of length 5\cdot 2^{s}\ell over \mathbb{F}_{2^{m}} and their enumeration in the following theorems.

    Theorem 6.6. Let q\equiv 1 \pmod 5 , then one of the following holds.

    (1) If f = \mathrm{ord}_{\ell}(q) is even, there exist (2^{s}+1)^{2+2e} self-dual cyclic codes of length 5\cdot 2^{s}\ell over \mathbb{F}_{2^{m}} , which are given by

    \begin{eqnarray*} &&\left((x-1)^{2^{s-1}}C_{\ell}(x)^{\varepsilon_{1}}C_{-\ell}(x)^{2^{s}-\varepsilon_{1}}C_{2\ell}(x)^{\varepsilon_{2}}C_{-2\ell}(x)^{2^{s}-\varepsilon_{2}}\right.\\ &&\times\left.\prod\limits_{k = 0}^{e-1}C_{\mu^{k}}(x)^{\tau_{k}}C_{-\mu^{k}}(x)^{2^{s}-\tau_{k}}C_{2\mu^{k}}(x)^{\rho_{k}}C_{-2\mu^{k}}(x)^{2^{s}-\rho_{k}}C_{5\mu^{k}}(x)^{2^{s-1}}\right), \end{eqnarray*}

    where 0\leq \varepsilon_{1}, \varepsilon_{2}, \tau_{k}, \rho_{k}\leq 2^{s} , for any 0\leq k\leq e-1 .

    (2) If f = \mathrm{ord}_{\ell}(q) is odd, there exist (2^{s}+1)^{2+\dfrac{5e}{2}} self-dual cyclic codes of length 5\cdot 2^{s}\ell over \mathbb{F}_{2^{m}} , which are given by

    \begin{eqnarray*} &&\left((x-1)^{2^{s-1}}C_{\ell}(x)^{\varepsilon_{1}}C_{-\ell}(x)^{2^{s}-\varepsilon_{1}}C_{2\ell}(x)^{\varepsilon_{2}}C_{-2\ell}(x)^{2^{s}-\varepsilon_{2}}\right.\\ &&\cdot\left.\prod\limits_{k = 0}^{e-1}C_{\mu^{k}}(x)^{\tau_{k}}C_{-\mu^{k}}(x)^{2^{s}-\tau_{k}}C_{2\mu^{k}}(x)^{\rho_{k}}C_{-2\mu^{k}}(x)^{2^{s}-\rho_{k}}\prod\limits_{k^{'} = 0}^{\frac{e}{2}-1}C_{5\mu^{k^{'}}}(x)^{\iota_{k^{'}}}C_{-5\mu^{k^{'}}}(x)^{2^{s}-\iota_{k^{'}}}\right), \end{eqnarray*}

    where 0\leq \varepsilon_{1}, \varepsilon_{2}, \tau_{k}, \rho_{k}, \iota_{k^{'}}\leq 2^{s} , for any 0\leq k\leq e-1 and any 0\leq k^{'}\leq \dfrac{e}{2}-1 .

    Proof.

    (1) By Lemma 6.2, any self-dual cyclic codes of length 5\cdot 2^{s}\ell over \mathbb{F}_{2^{m}} has the form of

    \begin{eqnarray*} &&\left((x-1)^{2^{s-1}}C_{\ell}(x)^{\varepsilon_{1}}C_{-\ell}(x)^{2^{s}-\varepsilon_{1}}C_{2\ell}(x)^{\varepsilon_{2}}C_{-2\ell}(x)^{2^{s}-\varepsilon_{2}}\right.\\ &&\times\left.\prod\limits_{k = 0}^{e-1}C_{\mu^{k}}(x)^{\tau_{k}}C_{-\mu^{k}}(x)^{2^{s}-\tau_{k}}C_{2\mu^{k}}(x)^{\rho_{k}}C_{-2\mu^{k}}(x)^{2^{s}-\rho_{k}}C_{5\mu^{k}}(x)^{2^{s-1}}\right), \end{eqnarray*}

    where 0\leq \varepsilon_{1}, \varepsilon_{2}, \tau_{k}, \rho_{k}\leq 2^{s} , for any 0\leq k\leq e-1 . Since each of \varepsilon_{1}, \varepsilon_{2} and \tau_{k}, \rho_{k} , 0\leq k\leq e-1 , has 2^{s}+1 possible values, we have in total (2^{s}+1)^{2+2e} self-dual cyclic codes of length 5\cdot 2^{s}\ell over \mathbb{F}_{2^{m}} .

    (2) By Lemma 6.2, any self-dual cyclic codes of length 5\cdot 2^{s}\ell over \mathbb{F}_{2^{m}} has the form of

    \begin{eqnarray*} &&\left((x-1)^{2^{s-1}}C_{\ell}(x)^{\varepsilon_{1}}C_{-\ell}(x)^{2^{s}-\varepsilon_{1}}C_{2\ell}(x)^{\varepsilon_{2}}C_{-2\ell}(x)^{2^{s}-\varepsilon_{2}}\right.\\ &&\cdot\left.\prod\limits_{k = 0}^{e-1}C_{\mu g^{k}}(x)^{\tau_{k}}C_{-\mu^{k}}(x)^{2^{s}- \tau_{k}}C_{2\mu^{k}}(x)^{\rho_{k}}C_{-2\mu^{k}}(x)^{2^{s}-\rho_{k}}\prod\limits_{k^{'} = 0}^{\frac{e}{2}-1}C_{5\mu^{k^{'}}}(x)^{\iota_{k^{'}}}C_{-5\mu^{k^{'}}}(x)^{2^{s}-\iota_{k^{'}}}\right), \end{eqnarray*}

    where 0\leq \varepsilon_{1}, \varepsilon_{2}, \tau_{k}, \rho_{k}, \iota_{k^{'}}\leq 2^{s} , for any 0\leq k\leq e-1 and any 0\leq k^{'}\leq \dfrac{e}{2}-1 . Each of \varepsilon_{1}, \varepsilon_{2} , \tau_{k}, \rho_{k}, 0\leq k\leq e-1 , and \iota_{k^{'}} , 0\leq k^{'}\leq \dfrac{e}{2}-1 , has 2^{s}+1 possible values, we have in total (2^{s}+1)^{2+\dfrac{5e}{2}} self-dual cyclic codes of length 5\cdot 2^{s}\ell over \mathbb{F}_{2^{m}} .

    The proofs of theorems for the rest of cases are similar, and we will give them without proofs.

    Theorem 6.7. Let q\equiv 4 \pmod 5 , then one of the following holds.

    (1) If f = 2t is even, then

    (i) when t is even, there exist (2^{s}+1)^{2e} self-dual cyclic codes of length 5\cdot 2^{s}\ell over \mathbb{F}_{2^{m}} , which are given by

    \left((x-1)^{2^{s-1}}C_{\ell}(x)^{2^{s-1}}C_{2\ell}(x)^{2^{s-1}}\prod\limits_{k = 0}^{e-1}C_{\mu^{k}}(x)^{\tau_{k}}C_{-\mu^{k}}(x)^{2^{s}-\tau_{k}}C_{2g^{k}}(x)^{\rho_{k}}C_{-2g^{k}}(x)^{2^{s}-\rho_{k}}C_{5g^{k}}(x)^{2^{s-1}}\right),

    where 0\leq \tau_{k}, \rho_{k}\leq 2^{s} , for any 0\leq k\leq e-1 .

    (ii) when t is odd, there exists only one self-dual cyclic codes of length 5\cdot 2^{s}\ell over \mathbb{F}_{2^{m}} , which is given by

    \left((x-1)^{2^{s-1}}C_{\ell}(x)^{2^{s-1}}C_{2\ell}(x)^{2^{s-1}}\prod\limits_{k^{'} = 0}^{2e-1}C_{\mu^{k^{'}}}(x)^{2^{s-1}}C_{2\mu^{k^{'}}}(x)^{2^{s-1}}\prod\limits_{k = 0}^{e-1}C_{5\mu^{k}}(x)^{2^{s-1}}\right).

    (2) If f is odd, thenthere exist (2^{s}+1)^{3e/2} self-dual cyclic codes of length 5\cdot 2^{s}\ell over \mathbb{F}_{2^{m}} , which are given by

    \begin{eqnarray*} &&\left((x-1)^{2^{s-1}}C_{\ell}(x)^{2^{s-1}}C_{2\ell}(x)^{2^{s-1}}\right.\\ &&\times\left.\prod\limits_{k^{'} = 0}^{e/2-1}C_{\mu^{k^{'}}}(x)^{\tau_{k^{'}}}C_{-\mu^{k^{'}}}(x)^{2^{s}-\tau_{k^{'}}}C_{2\mu^{k^{'}}}(x)^{\rho_{k^{'}}}C_{-2\mu^{k^{'}}}(x)^{2^{s}-\rho_{k^{'}}}C_{5\mu^{k^{'}}}(x)^{\iota_{k^{'}}}C_{-5\mu^{k^{'}}}(x)^{2^{s}-\iota_{k^{'}}}\right). \end{eqnarray*}

    Theorem 6.8. Let q\equiv 2 or 3 \pmod 5 , then one of the following holds.

    (1) If 4\mid f . Let f = 4t , then

    (i) when t is even, there exist (2^{s}+1)^{2e} self-dual cyclic codes of length 5\cdot 2^{s}\ell over \mathbb{F}_{2^{m}} , which are given by

    \left((x-1)^{2^{s-1}}C_{\ell}(x)^{2^{s-1}}\prod\limits_{k^{''} = 0}^{2e-1}C_{\mu^{k}}(x)^{\tau_{k^{''}}}C_{-\mu^{k^{''}}}(x)^{2^{s}-\tau_{k^{''}}}\prod\limits_{k = 0}^{e-1}C_{5\mu^{k}}(x)^{2^{s-1}}\right),

    where 0\leq \tau_{k^{''}}\leq 2^{s} , for any 0\leq k^{''}\leq 2e-1 .

    (ii) when t is odd, there exists only one self-dual cyclic codes of length 5\cdot 2^{s}\ell over \mathbb{F}_{2^{m}} , which is given by

    \left((x-1)^{2^{s-1}}C_{\ell}(x)^{2^{s-1}}\prod\limits_{k^{'} = 0}^{4e-1}C_{\mu^{k^{'}}}(x)^{2^{s-1}}\prod\limits_{k = 0}^{e-1}C_{5\mu^{k}}(x)^{2^{s-1}}\right),

    (2) If 2\mid f but 4\nmid f , then there exist (2^{s}+1)^{e} self-dual cyclic codes of length 5\cdot 2^{s}\ell over \mathbb{F}_{2^{m}} , which are given by

    \left((x-1)^{2^{s-1}}C_{\ell}(x)^{2^{s-1}}\prod\limits_{k = 0}^{e-1}C_{\mu^{k}}(x)^{\tau_{k}}C_{-\mu^{k}}(x)^{2^{s}-\tau_{k}}C_{5\mu^{k}}(x)^{2^{s-1}}\right),

    where 0\leq \tau_{k}\leq 2^{s} , for any 0\leq k\leq e-1 .

    (3) If f is odd, then there exist (2^{s}+1)^{e} self-dual cyclic codes of length 5\cdot 2^{s}\ell over \mathbb{F}_{2^{m}} , which are given by

    \left((x-1)^{2^{s-1}}C_{\ell}(x)^{2^{s-1}}\prod\limits_{k^{'} = 0}^{\dfrac{e}{2}-1}C_{\mu^{k^{'}}}(x)^{\tau_{k^{'}}}C_{-\mu^{k^{'}}}(x)^{2^{s}-\tau_{k^{'}}}C_{5\mu^{k^{'}}}(x)^{\iota_{k^{'}}}C_{-5\mu^{k^{'}}}(x)^{2^{s}-\iota_{k^{'}}}\right),

    where 0\leq \tau_{k^{'}}, \iota_{k^{'}}\leq 2^{s} , for any 0\leq k^{'}\leq \dfrac{e}{2}-1 .

    The first author was supported by the Yuyou Team Support Program of North China University of Technology (No. 107051360019XN137/007) and Yujie Talent Project of North China University of Technology(No. 107051360022XN735).

    The authors declare no conflict of interest.



    [1] L. A. Zadeh, Fuzzy sets, Inform. Control, 8 (1965), 338–353. https://doi.org/10.1016/S0019-9958(65)90241-X doi: 10.1016/S0019-9958(65)90241-X
    [2] L. A. Zadeh, The concept of a linguistic variable and its application to approximate reasoning-I, Inform. Sci., 8 (1975), 199–249. https://doi.org/10.1016/0020-0255(75)90036-5 doi: 10.1016/0020-0255(75)90036-5
    [3] V. Torra, Hesitant fuzzy sets, Int. J. Intell. Syst., 25 (2010), 529–539. https://doi.org/10.1002/int.20418 doi: 10.1002/int.20418
    [4] X. D. Peng, Y. Yang, Some results for Pythagorean fuzzy sets, Int. J. Intell. Syst., 30 (2015), 1133–1160. https://doi.org/10.1002/int.21738 doi: 10.1002/int.21738
    [5] K. T. Atanassov, Intuitionistic fuzzy sets, Fuzzy Set. Syst., 20 (1986), 87–96. https://doi.org/10.1016/S0165-0114(86)80034-3 doi: 10.1016/S0165-0114(86)80034-3
    [6] R. R. Yager, Pythagorean membership grades in multi-criteria decision making, IEEE T. Fuzzy Syst., 22 (2014), 958–965. https://doi.org/10.1109/TFUZZ.2013.2278989 doi: 10.1109/TFUZZ.2013.2278989
    [7] R. R. Yager, Generalized orthopair fuzzy sets, IEEE T. Fuzzy Syst., 25 (2017), 1220–1230. https://doi.org/10.1109/TFUZZ.2016.2604005 doi: 10.1109/TFUZZ.2016.2604005
    [8] F. Smarandache, A unifying field in logics, neutrosophy: Neutrosophic probability, set and logic, American Research Press, Rehoboth, DE, USA, 1999, 1–141.
    [9] B. C. Cuong, Picture fuzzy sets, J. Comput. Sci. Cybern., 30 (2014), 409–420. https://doi.org/10.15625/1813-9663/30/4/5032 doi: 10.15625/1813-9663/30/4/5032
    [10] F. K. Gundogdu, C. Kahraman, Spherical fuzzy sets and spherical fuzzy TOPSIS method, J. Intell. Fuzzy Syst., 36 (2019), 337–352. https://doi.org/10.3233/JIFS-181401 doi: 10.3233/JIFS-181401
    [11] X. Gou, Z. Xu, P. Ren, The properties of continuous Pythagorean fuzzy information, Int. J. Intell. Syst., 31 (2016), 401–424. https://doi.org/10.1002/int.21788 doi: 10.1002/int.21788
    [12] X. Gou, Z. Xu, Novel basic operational laws for linguistic terms, hesitant fuzzy linguistic term sets and probabilistic linguistic term sets, Inform. Sci., 372 (2016), 407–427. https://doi.org/10.1016/j.ins.2016.08.034 doi: 10.1016/j.ins.2016.08.034
    [13] X. Gou, Z. Xu, H. Liao, F. Herrera, Probabilistic double hierarchy linguistic term set and its use in designing an improved VIKOR method: The application in smart healthcare, J. Oper. Res. Soc., 72 (2021), 2611–2630. https://doi.org/10.1080/01605682.2020.1806741 doi: 10.1080/01605682.2020.1806741
    [14] W. R. Zhang, Bipolar fuzzy sets and relations, A computational framework for cognitive modeling and multiagent decision analysis, In: NAFIPS/IFIS/NASA94, Proceedings of the First International Joint Conference of The North American Fuzzy Information Processing Society Biannual Conference, IEEE, San Antonio, TX, USA, 1994,305–309. https://doi.org/10.1109/IJCF.1994.375115
    [15] W. R. Zhang, (Yin)(Yang) bipolar fuzzy sets, In: IEEE International Conference on Fuzzy Systems Proceedings. IEEE World Congress on Computational Intelligence, IEEE, Anchorage, AK, USA, 1 (1998), 835–840. https://doi.org/10.1109/FUZZY.1998.687599
    [16] Y. B. Jun, C. S. Kim, K. O. Yang, Cubic sets, Annal. Fuzzy Math. Inform., 4 (2012), 83–98.
    [17] H. Garg, G. Kaur, Cubic intuitionistic fuzzy sets and its fundamental properties, J. Mult.-Valued Log. S., 33 (2019), 507–537.
    [18] H. Garg, G. Kaur, TOPSIS based on nonlinear-programming methodology for solving decision-making problems under cubic intuitionistic fuzzy set environment, Comput. Appl. Math., 38 (2019), 1–19. https://doi.org/10.1007/s40314-019-0869-6 doi: 10.1007/s40314-019-0869-6
    [19] H. Garg, G. Kaur, Algorithm for solving the decision-making problems based on correlation coefficients under cubic intuitionistic fuzzy information: A case study in watershed hydrological system, Compl. Intell. Syst., 8 (2022), 179–198. https://doi.org/10.1007/s40747-021-00339-4 doi: 10.1007/s40747-021-00339-4
    [20] S. Z. Abbas, M. S. A. Khan, S. Abdullah, H. Sun, F. Hussain, Cubic Pythagorean fuzzy sets and their application to multi-attribute decision making with unknown weight information, J. Intell. Fuzzy Syst., 37 (2019), 1529–1544. https://doi.org/10.3233/JIFS-18382 doi: 10.3233/JIFS-18382
    [21] F. Wang, X. Zhao, Prospect-theory and geometric distance measure-based Pythagorean cubic fuzzy multicriteria decision-making, Int. J. Intell. Syst., 36 (2021), 4117–4142. https://doi.org/10.1002/int.22453 doi: 10.1002/int.22453
    [22] M. Riaz, S. T. Tehrim, Cubic bipolar fuzzy ordered weighted geometric aggregation operators and their application using internal and external cubic bipolar fuzzy data, Comput. Appl. Math., 38 (2019), 1–25. https://doi.org/10.1007/s40314-019-0843-3 doi: 10.1007/s40314-019-0843-3
    [23] M. Riaz, S. T. Tehrim, Multi-attribute group decision making based on cubic bipolar fuzzy information using averaging aggregation operators, J. Intell. Fuzzy Syst., 37 (2019), 2473–2494. https://doi.org/10.3233/JIFS-182751 doi: 10.3233/JIFS-182751
    [24] M. Riaz, S. T. Tehrim, Cubic bipolar fuzzy set with application to multi-criteria group decision making using geometric aggregation operators, Soft Comput., 24 (2020), 16111–16133. https://doi.org/10.1007/s00500-020-04927-3 doi: 10.1007/s00500-020-04927-3
    [25] N. Jan, L. Zedam, T. Mahmood, K. Ullah, Cubic bipolar fuzzy graphs with applications, J. Intell. Fuzzy Syst., 37 (2019), 2289–2307. https://doi.org/10.3233/JIFS-182579 doi: 10.3233/JIFS-182579
    [26] N. Jamil, M. Riaz, Bipolar disorder diagnosis with cubic bipolar fuzzy information using TOPSIS and ELECTRE-I, Int. J. Biomath., 15 (2022), 2250030. https://doi.org/10.1142/S1793524522500309 doi: 10.1142/S1793524522500309
    [27] M. Riaz, N. Jamil, Topological structures on cubic bipolar fuzzy sets with linear assignment model and SIR method for healthcare, J. Intell. Fuzzy Syst., 44 (2023), 1191–1212. https://doi.org/10.3233/JIFS-222224 doi: 10.3233/JIFS-222224
    [28] Z. S. Xu, Intuitionistic fuzzy aggregation operators, IEEE T. Fuzzy Syst., 15 (2007), 1179–1187. https://doi.org/10.1109/TFUZZ.2006.890678 doi: 10.1109/TFUZZ.2006.890678
    [29] Z. S. Xu, R. R. Yager, Some geometric aggregation operators based on intuitionistic fuzzy sets, Int. J. Gen. Syst., 35 (2006), 417–433. https://doi.org/10.1080/03081070600574353 doi: 10.1080/03081070600574353
    [30] T. Senapati, G. Chen, R. Mesiar, R. R. Yager, Novel Aczel-Alsina operations-based interval-valued intuitionistic fuzzy aggregation operators and their applications in multiple attribute decision-making process, Int. J. Intell. Syst., 37 (2022), 5059–5081. https://doi.org/10.1002/int.22751 doi: 10.1002/int.22751
    [31] T. Senapati, Approaches to multi-attribute decision-making based on picture fuzzy Aczel-Alsina average aggregation operators, Comput. Appl. Math., 41 (2022), 40. https://doi.org/10.1007/s40314-021-01742-w doi: 10.1007/s40314-021-01742-w
    [32] C. Tian, J. J. Peng, Z. Q. Zhang, J. Q. Wang, M. Goh, An extended picture fuzzy MULTIMOORA method based on Schweizer-Sklar aggregation operators, Soft Comput., 26 (2022), 3435–3454. https://doi.org/10.1007/s00500-021-06690-5 doi: 10.1007/s00500-021-06690-5
    [33] F. Xiao, J. Wen, W. Pedrycz, Generalized divergence-based decision making method with an application to pattern classification, IEEE T. Knowl. Data Eng., 2022. https://doi.org/10.1109/TKDE.2022.3177896 doi: 10.1109/TKDE.2022.3177896
    [34] F. Xiao, GIQ: A generalized intelligent quality-based approach for fusing multisource information, IEEE T. Fuzzy Syst., 29 (2021), 2018–2021. https://doi.org/10.1109/TFUZZ.2020.2991296 doi: 10.1109/TFUZZ.2020.2991296
    [35] F. Xiao, A distance measure for intuitionistic fuzzy sets and its application to pattern classification problems, IEEE T. Syst. Man. Cyber. Syst., 51 (2021), 3980–3992, https://doi.org/10.1109/TSMC.2019.2958635 doi: 10.1109/TSMC.2019.2958635
    [36] M. Riaz, M. R. Hashmi, Linear Diophantine fuzzy set and its applications towards multi-attribute decision-making problems, J. Intell. Fuzzy Syst., 37 (2019), 5417–5439. https://doi.org/10.3233/JIFS-190550 doi: 10.3233/JIFS-190550
    [37] H. Kamaci, D. Marinkovic, S. Petchimuthu, M. Riaz, S. Ashraf, Novel distance-measures-based extended TOPSIS method under linguistic linear Diophantine fuzzy information, Symmetry, 14 (2022), 2140. https://doi.org/10.3390/sym14102140 doi: 10.3390/sym14102140
    [38] M. Akram, Bipolar fuzzy graphs, Inf. Sci., 181 (2011), 5548–5564. https://doi.org/10.1016/j.ins.2011.07.037 doi: 10.1016/j.ins.2011.07.037
    [39] M. A. Alghamdi, N. O. Alshehri, M. Akram, Multicriteria decision-making methods in bipolar fuzzy environment, Int. J. Fuzzy Syst., 20 (2018), 2057–2064. https://doi.org/10.1007/s40815-018-0499-y doi: 10.1007/s40815-018-0499-y
    [40] M. Akram, Shumaiza, M. Arshad, Bipolar fuzzy TOPSIS and bipolar fuzzy ELECTRE-I methods to diagnosis, Comput. Appl. Math., 39 (2020), 1–21. https://doi.org/10.1007/s40314-019-0980-8 doi: 10.1007/s40314-019-0980-8
    [41] H. Garg, Sine trigonometric operational laws and its based Pythagorean fuzzy aggregation operators for group decision-making process, Artif. Intell. Rev., 54 (2021), 4421–4447. https://doi.org/10.1007/s10462-021-10002-6 doi: 10.1007/s10462-021-10002-6
    [42] H. Garg, A novel trigonometric operation-based q-rung orthopair fuzzy aggregation operator and its fundamental properties, Neural Comput. Appl., 32 (2020), 15077–15099. https://doi.org/10.1007/s00521-020-04859-x doi: 10.1007/s00521-020-04859-x
    [43] M. Qiyas, S. Abdullah, Sine trigonometric spherical fuzzy aggregation operators and their application in decision support system, TOPSIS, VIKOR, Korean J. Math., 29 (2021), 137–167. https://doi.org/10.11568/kjm.2021.29.1.137 doi: 10.11568/kjm.2021.29.1.137
    [44] S. Ashraf, S. Abdullah, S. Zeng, H. Jin, F. Ghani, Fuzzy decision support modeling for hydrogen power Plant selection based on single valued neutrosophic sine trigonometric aggregation operators, Symmetry, 12 (2020), 298. https://doi.org/10.3390/sym12020298 doi: 10.3390/sym12020298
    [45] M. W. Lin, C. Huang, Z. S. Xu, R. Chen, Evaluating IoT platforms using integrated probabilistic linguistic MCDM method, IEEE Int. Things J., 7 (2020), 11195–11208. https://doi.org/10.1109/JIOT.2020.2997133 doi: 10.1109/JIOT.2020.2997133
    [46] C. Huang, M. W. Lin, Z. S. Xu, Pythagorean fuzzy MULTIMOORA method based on distance measure and score function: Its application in multicriteria decision making process, Knowl. Inform. Syst., 62 (2020), 4373–4406. https://doi.org/10.1007/s10115-020-01491-y doi: 10.1007/s10115-020-01491-y
    [47] M. W. Lin, C. Huang, Z. S. Xu, TOPSIS method based on correlation coefficient and entropy measure for linguistic Pythagorean fuzzy sets and its application to multiple attribute decision making, Complexity, 2019 (2019), 6967390. https://doi.org/10.1155/2019/6967390 doi: 10.1155/2019/6967390
    [48] M. Riaz, D. Pamucar, A. Habib, N. Jamil, Innovative bipolar fuzzy sine trigonometric aggregation operators and SIR method for medical tourism supply chain, Math. Probl. Eng., 2022 (2022), 1–17. https://doi.org/10.1155/2022/4182740 doi: 10.1155/2022/4182740
    [49] C. Jana, M. Pal, J. Q. Wang, Bipolar fuzzy Dombi aggregation operators and its application in multiple-attribute decision-making process, J. Amb. Intel. Hum. Comp., 10 (2019), 3533–3549. https://doi.org/10.1007/s12652-018-1076-9 doi: 10.1007/s12652-018-1076-9
    [50] M. Riaz, A. Habib, M. Saqlain, M. S. Yang, Cubic bipolar fuzzy-VIKOR method using new distance and entropy measures and Einstein averaging aggregation operators with application to renewable energy, Int. J. Fuzzy Syst., 25 (2023), 510–543. https://doi.org/10.1007/s40815-022-01383-z doi: 10.1007/s40815-022-01383-z
    [51] G. Kaur, H. Garg, Cubic intuitionistic fuzzy aggregation operators, Int. J. Uncert. Quant., 8 (2018). https://doi.org/10.1615/Int.J.UncertaintyQuantification.2018020471 doi: 10.1615/Int.J.UncertaintyQuantification.2018020471
  • This article has been cited by:

    1. Qi Zhang, Weiqiong Wang, Shuyu Luo, Yue Li, Repeated-root constacyclic codes of length klp over finite fields, 2025, 101, 10715797, 102542, 10.1016/j.ffa.2024.102542
    2. Jinle Liu, Hongfeng Wu, A Note on Factorization and the Number of Irreducible Factors of xn − λ over Finite Fields, 2025, 13, 2227-7390, 473, 10.3390/math13030473
  • Reader Comments
  • © 2023 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(1464) PDF downloads(62) Cited by(4)

Figures and Tables

Figures(5)  /  Tables(13)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog