Abstract

Linear codes over finite fields with small dimensional hulls have received much attention due to their applications in cryptology and quantum computing. In this paper, we study cyclic and negacyclic codes with one-dimensional hulls. We determine precisely when cyclic and negacyclic codes over finite fields with one-dimensional hulls exist. We also introduce one-dimensional linear complementary pairs of cyclic and negacyclic codes. As an application, we obtain numerous optimal or near optimal cyclic codes with one-dimensional hulls over different fields and, by using these codes, we present new entanglement-assisted quantum error-correcting codes (EAQECCs). In particular, some of these EAQEC codes are maximal distance separable (MDS). We also obtain one-dimensional linear complementary pairs of cyclic codes, which are either optimal or near optimal.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call