Search

Recently, the research of trace codes over finite fields has received a lot of attention because some of these codes have good parameters. In this paper, we construct several classes of trace codes from some special classes of linear codes and give their weight distributions, showing that they contain some optimal and almost optimal codes. Furthermore, we determine the parameters of the duals of the trace codes, and show that they are distance-optimal or nearly distance-optimal with respect to the sphere-packing bound. [ABSTRACT FROM AUTHOR]

Entanglement-assisted quantum error-correcting (EAQEC) codes can be obtained from arbitrary classical linear codes, based on the entanglement-assisted stabilizer formalism. However, how to determine the required number of shared pairs is challenging. In this paper, we first construct three classes of classical linear MDS codes over finite fields by considering generalized Reed–Solomon codes and calculate the dimension of their Hermitian hulls. By using these MDS codes, we then obtain three new classes of EAQEC codes and EAQEC MDS codes, whose maximally entangled states can take various values. Moreover, these EAQEC codes have more flexible lengths. [ABSTRACT FROM AUTHOR]

Let R be the polynomial residue ring F q 2 + u F q 2 , where F q 2 is the finite field with q 2 elements, q is a power of a prime p, and u is an indeterminate with u 2 = 0. We introduce a Gray map from R to F q 2 p and study (1 - u) -constacyclic codes over R. It is proved that the image of a (1 - u) -constacyclic code of length n over R under the Gray map is a distance-invariant linear cyclic code of length pn over F q 2. We give some necessary and sufficient conditions for (1 - u) -constacyclic codes over R to be Hermitian dual-containing. In particular, a new class of 2 m -ary quantum codes is obtained via the Gray map and the Hermitian construction from Hermitian dual-containing (1 - u) -constacyclic codes over the ring F 2 2 m + u F 2 2 m . [ABSTRACT FROM AUTHOR]