The -intersection Pairs of Constacyclic and Conjucyclic Codes
Abstract
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 Fq2. 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 Fq-subcode of an ACC code over Fq2 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 F4.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.