Skip to content

Euclidean Hulls of Double Cyclic Codes of Arbitrary Block Lengths

Awadhesh Kumar Shukla, Om Prakash Pandey, Sachin Pathak, Ashish Upadhyay

cs.ITarXiv:2611.13481

Abstract

A Z2-double cyclic code of block length (r,s) can be viewed as a Z2[x]-submodule of Z2[x]/ xr - 1 × Z2[x]/ xs - 1 . In 2023, Gao et al. GWF23 investigated the Euclidean hulls of double cyclic codes over Z2 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., (r,s)=1) and left the non-coprime case ((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.

Create a lesson