Generator polynomial matrices of the Galois hulls of multi-twisted codes

Abstract

In this study, we consider the Euclidean and Galois hulls of multi-twisted (MT) codes over a finite field Fpe of characteristic p. Let G be a generator polynomial matrix (GPM) of a MT code C. For any 0 <e, the -Galois hull of C, denoted by h(C), is the intersection of C with its -Galois dual. The main result in this paper is that a GPM for h(C) has been obtained from G. We start by associating a linear code QG with G. We show that QG is quasi-cyclic. In addition, we prove that the dimension of h(C) is the difference between the dimension of C and that of QG. Thus the determinantal divisors are used to derive a formula for the dimension of h(C). Finally, we deduce a GPM formula for h(C). In particular, we handle the cases of -Galois self-orthogonal and linear complementary dual MT codes; we establish equivalent conditions that characterize these cases. Equivalent results can be deduced immediately for the classes of cyclic, constacyclic, quasi-cyclic, generalized quasi-cyclic, and quasi-twisted codes, because they are all special cases of MT codes. Some numerical examples, containing optimal and maximum distance separable codes, are used to illustrate the theoretical results.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…