Paperlane

no. 13 · Wednesday 11 November 2026

Euclidean Hulls of Double Cyclic Codes of Arbitrary Block Lengths

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

math.IT

Abstract

Gao et al. \cite{GWF23} recently explored the Euclidean hulls of double cyclic codes over $\mathbb{Z}_2$. While they found answers for non-separable codes with coprime lengths ($\gcd(r, s) = 1$), the non-coprime case ($\gcd(r, s) > 1$) remained an open question. This paper completely solves that problem for all possible block lengths. We calculate the exact generator polynomials for the hull and show the precise conditions needed for a non-separable code to turn into a separable one. Using this, we show how to construct non-separable LCD codes. We also include several numerical examples to confirm our findings.

fields
Information Theory
pdf ↗ page arXiv:2611.13481 ↗