Most coding theory experts date the origin of the subject with the 1948 publication of A
Mathematical Theory of Communication by Claude Shannon. Since then, coding theory has …

The intersection () of a linear code and its Euclidean dual (Hermitian dual) is called the
Euclidean (Hermitian) hull of this code. It is natural to consider the hull-variation problem …

In this paper, a linear ℓ ℓ-intersection pair of codes is introduced as a generalization of linear
complementary pairs of codes. Two linear codes are said to be a linear ℓ ℓ-intersection pair …

The Euclidean hull of a linear code is the intersection of with its Euclidean dual. The hull with
low dimensions gets much interest due to its crucial role in determining the complexity of …

In this paper, we clarify some aspects of LCD codes in the literature. We first prove that non-
free LCD codes do not exist over finite commutative Frobenius local rings. We then obtain a …

The hull of a linear code is defined to be the intersection of the code and its dual, and was
originally introduced to classify finite projective planes. The hull plays an important role in …

In recent years, linear complementary pairs (LCPs) of codes and linear complementary dual
(LCD) codes have gained significant attention due to their applications in coding theory and …

Using algebraic curves over finite fields, we construct some codes suitable for being used in
the countermeasure called Direct Sum Masking which allows, when properly implemented …

In this work, we first prove a necessary and sufficient condition for a pairs of linear codes
over finite rings to be linear complementary pairs (abbreviated to LCPs). In particular, a …

In this paper, we first generalize the complementary pair of codes over finite fields to an l-
linear complementary pair (l-LCP) of codes. Then two criteria of l-LCP of codes over finite …