Complete weight enumerators of a class of linear codes with two weights

In this paper, a class of p-ary linear codes with two weights is constructed by using the properties of cyclotomic classes of Fp2∗. The complete weight enumerators of these linear codes are also determined. In some cases, they are optimal and can be employed to obtain secret sharing schemes with interesting access structures and asymptotically optimal systematic authentication codes.