Complete weight enumerators of two classes of linear codes

Recently, linear codes with a few weights have been constructed and extensively studied. In this paper, for an odd prime p, we determine the complete weight enumerator of two classes of p-ary linear codes constructed from defining set. Our results show that the codes have at most seven weights and may have applications in secret sharing schemes.