We construct a new class of linear codes with defining set. Their complete weight enumerators and weight enumerators are determined explicitly by applying the calculation technique of exponential sums and the theory of cyclotomic numbers over finite fields. They are twoweight codes and can be applied in strongly regular graph construction and secret sharing schemes.