Quantum error-correcting codes have gained prominence since the initial discovery of Shor and Steane. In 1998, Calderbank et al. presented systematic methods to construct binary quantum codes, called stabilizer codes or additive codes, from classical error-correcting codes. Since then the field has made rapid progress, many good binary quantum codes were constructed by using classical error-cor...

<p style='text-indent:20px;'>Let <inline-formula><tex-math id="M1">\begin{document}$ \mathbb{F}_{q} $\end{document}</tex-math></inline-formula> be a finite field with character id="M2">\begin{document}$ p $\end{document}</tex-math></inline-formula>. In this paper, the multiplicative group id="M3">\begin{document}$ \mathbb{F}_{q}^{*} = \mathbb{F}_{...

Linear codes may be endowed with cyclic structures by means of skew polynomial rings. This is the case of Piret cyclic convolutional codes [26] and the subsequent generalizations and alternatives (see [27], [14], [11], [25], [16], [20]). Non commutative cyclic structures of this kind have been also considered for block linear codes ([7], [5], [4], [12], [1]), and for linear codes over commutati...