Complete weight enumerators of a new class of linear codes

For an odd prime p, let q = p(m), and denote Tr-e(m) the trace function from F-q onto F-p(e) where e is a divisor of m. For a positive integer t and a is an element of F-p(e), let D-a = {(x(1), x(2), ... ,x(t)) is an element of F-q(t) \ {(0, 0, ... ,0)} : Tr-e(m)(x(1), + x(2) + . . . + = a}, and define a p-ary linear code C-Da as C-Da = (C(X-1, X-2, ... , X-t) : (X-1, X-2, ... , Xt) is an element of F-q(t), where c(x(1), x(2), ... , x(t)) = (Tr-1(m)(x(1)d(1)(2) + x(2)d(2)(2) + . . . + x(t)d(t)(2)))((d1,d2 dt)is an element of Da). The complete weight enumerators of linear codes C-Da will be presented for any divisor e of m and alpha is an element of F-p(e) and this new result generalizes that of both Ahn et al. (2017) and Yang et al. (2017). (C) 2018 Elsevier B.V. All rights reserved.