The $\ell$-intersection Pairs of Constacyclic and Conjucyclic Codes

TL;DR

This paper studies the structure and properties of $ ell$-intersection pairs of constacyclic and conjucyclic codes, providing formulas, characterizations, and conditions for their existence and properties over finite fields.

Contribution

It characterizes $ ell$-intersection pairs of constacyclic codes and introduces the concept for conjucyclic codes, including formulas, conditions, and size analysis.

Findings

Established a formula for $ ell$ in terms of generator polynomial degrees.

Provided conditions for $ ell$-linear complementary pairs of constacyclic codes.

Characterized $ ell$-intersection pairs of trace codes of additive conjucyclic codes over $_{4}$.

Abstract

A pair of linear codes whose intersection is of dimension $\ell$, where $\ell$ is a non-negetive integer, is called an $\ell$-intersection pair of codes. This paper focuses on studying $\ell$-intersection pairs of $\lambda_i$-constacyclic, $i=1,2,$ and conjucyclic codes. We first characterize an $\ell$-intersection pair of $\lambda_i$-constacyclic codes. A formula for $\ell$ has been established in terms of the degrees of the generator polynomials of $\lambda_i$-constacyclic codes. This allows obtaining a condition for $\ell$-linear complementary pairs (LPC) of constacyclic codes. Later, we introduce and characterize the $\ell$-intersection pair of conjucyclic codes over $\mathbb{F}_{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 $\mathbb{F}_q$-subcode of an ACC code over $\mathbb{F}_{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 $\ell$-intersection pairs of trace codes of ACC codes over $\mathbb{F}_4$.