On construction of linear (Euclidean) hull codes over finite extensions binary fields

The hull of a linear code is defined as the intersection of the code and its dual. This concept was initially introduced to classify finite projective planes. The hull plays a crucial role in determining the complexity of algorithms used to check the permutation equivalence of two linear codes and compute a linear code’s automorphism group. Research has shown that these algorithms are very effective when the hull size is small. Linear complementary dual (LCD) codes have the smallest hulls, while codes with a one-dimensional hull have the second smallest. A recent notable paper that directs our investigation is authored by H. Chen, titled “On the Hull-Variation Problem of Equivalent Linear Codes", published in IEEE Transactions on Information Theory, volume 69, issue 5, in 2023. In this paper, we first explore the one-dimensional hull of a linear code over finite fields. Additionally, we demonstrate that any LCD code over an extended binary field $$ \mathrm{I\!F}_q $$ (where $$ q > 3 $$ ) with a minimum distance of at least 2 is equivalent to the one-dimensional hull of a linear code under a specific weak condition. Furthermore, we provide a construction for creating hulls with $$ \ell + 1 $$ -dimensionality from an $$ \ell $$ -dimensional hull of a linear code, again under a weak condition. This corresponds to a particularly challenging direction, as creating $$ \ell $$ -dimensional hulls from $$ \ell + 1 $$ -dimensional hulls. Finally, we derive several constructions for the $$ \ell $$ -dimensional hulls of linear codes as a consequence of our results.