The ℓ-intersection Pairs of Constacyclic and Conjucyclic Codes
share
A pair of linear codes whose intersection is of dimension ℓ, where ℓ is a non-negetive integer, is called an ℓ-intersection pair of codes. This paper focuses on studying ℓ-intersection pairs of λ_i-constacyclic, i=1,2, and conjucyclic codes. We first characterize an ℓ-intersection pair of λ_i-constacyclic codes. A formula for ℓ has been established in terms of the degrees of the generator polynomials of λ_i-constacyclic codes. This allows obtaining a condition for ℓ-linear complementary pairs (LPC) of constacyclic codes. Later, we introduce and characterize the ℓ-intersection pair of conjucyclic codes over 𝔽_q^2. The first observation in the process is that there are no non-trivial linear conjucyclic codes over finite fields. So focus on the characterization of additive conjucyclic (ACC) codes. We show that the largest 𝔽_q-subcode of an ACC code over 𝔽_q^2 is cyclic and obtain its generating polynomial. This enables us to find the size of an ACC code. Furthermore, we discuss the trace code of an ACC code and show that it is cyclic. Finally, we determine ℓ-intersection pairs of trace codes of ACC codes over 𝔽_4.
READ FULL TEXT