Two classes of constacyclic codes with variable parameters (Q6169006)

Let \(\lambda\in \mathrm{GF}(q)^\ast,\) a linear code \(C\) of length \(n\) is said to be \(\lambda\)-constacyclic if from \(c\in C\) it follows \((\lambda c_{n-1}, c_0, c_1,\ldots, c_{n-2})\in C.\) Let \(\Phi: \mathrm{GF}(q)^n\rightarrow \mathrm{GF}(q)[x] / \langle x^n-\lambda\rangle\) defined by \(\Phi((c_0,\ldots,c_{n-1})=\sum_{i=0}^{n-1}c_ix^i.\) A code \(C\) can be identified with \(\Phi(C)\) for any \(\lambda\)-constacyclic code \(C.\) When \(C = \langle g(x)\rangle\) be a \(\lambda-\)constacyclic code, where \(g(x)\) is monic and has the smallest degree, we say \(g(x)\) the generator polynomial. The dual code \(C^\bot\) of \(C\) is a \(\lambda^{-1}\)-constacyclic code. Firstly, a general construction of constacyclic codes of length \(\frac{q^{m-1}}{r}\) using cyclic codes of length \(q^{m-1}\) is shown. Two classes of constacyclic codes are constructed using a general construction of constacyclic codes with cyclic codes. The first class of constacyclic codes is motivated by the punctured Dilix cyclic codes. Define \(C_i^{(q,rn)}=\{i,iq,\ldots, iq^{\ell_i-1}\}\mod{rn}\) -- the cyclotomic coset of \(i\) modulo \(rn.\) Let \(m = \operatorname{ord}_{rn}(q)\) and there is a primitive element \(\alpha\in \mathrm{GF}(q^m)\) such that \(\beta =\alpha ^{\frac{(q^m-1)}{rn}}, \beta^n = \lambda.\) The minimal polynomial \(\mathbb{M}_{\beta_i}(x)=\sum\limits_{j\in C_i^{(q,rn)}}(x-\beta^j).\) For \(g'_{(q,m,\ell)}(x)=\prod \mathbb{M}_{\beta^i}(x)\) the set \(D'{(q,m,\ell)}\) is the union of the codeset. Using \(D'_{(q,m,\ell)}\) as defining set of the code \(C'_{(q,m,\ell)}\) the authors find its dimension as well as show a lower bound of its minimum distance. The second class of constacyclic codes is motivated by the punctured generalised Reed-Muller codes. The parameters of the second class are also analyzed, and some open problems are presented. For the entire collection see [Zbl 1516.11002].