Search

Galois hulls are generalizations of Euclidean and Hermitian hulls, which have attracted interest because of their important applications in determining the complexity of some algorithms about linear codes and in constructing entanglement-assisted quantum error-correcting codes (EAQECCs). In this paper, the whole contribution is two-folded. On one hand, we propose explicit methods to construct linear codes of larger lengths with Galois hulls of arbitrary dimensions from given Galois self-orthogonal codes. Conditions required in our approach are proven to be relatively weak. On the other hand, we apply these results to construct EAQECCs. Two bounds for EAQECCs constructed from linear codes with prescribed dimensional Galois hull are given and EAQECCs with rates greater than or equal to 1 2 and positive net rates can be obtained. We also present many interesting examples to explain visually how these two aspects work. [ABSTRACT FROM AUTHOR]

In this paper, we give the structures of all ( 1 + u + v ) -constacyclic codes of length 2 s over F 2 + u F 2 + v F 2 + u v F 2 , we also obtain the number of codewords, and the dual of each constacyclic code. Among other results, we study the form of such constacyclic codes that are self-dual and give the number of these codes. We end by giving all self-dual constacyclic codes of length 2, 4 and 8. [ABSTRACT FROM AUTHOR]