Euclidean Hulls of Double Cyclic Codes of Arbitrary Block Lengths
Awadhesh Kumar Shukla, Om Prakash Pandey, Sachin Pathak, Ashish Upadhyay
原文摘要
A $\mathbb{Z}_2$-double cyclic code of block length $(r,s)$ can be viewed as a $\mathbb{Z}_2[x]$-submodule of $\mathbb{Z}_2[x]/\langle x^r - 1 \rangle \times \mathbb{Z}_2[x]/\langle x^s - 1 \rangle$. In 2023, Gao et al. \cite{GWF23} investigated the Euclidean hulls of double cyclic codes over $\mathbb{Z}_2$ for both separable and non-separable cases. In the non-separable setting, they determined the hull generators under the assumption that the block lengths are coprime (i.e., $\gcd(r,s)=1$) and left the non-coprime case ($\gcd(r,s) > 1$) as an open problem. In this paper, we resolve this open problem by deriving the explicit hull generators for arbitrary block lengths $(r,s)$, recovering the coprime setting as a special case of our framework. Furthermore, we establish the necessary and sufficient conditions for non-separable double cyclic codes to be linear complementary dual (LCD) and provide several numerical examples to validate our theoretical findings.
cs.IT