Linear codes with a few weights have wide applications in information
security, data storage systems, consuming electronics and communication
systems. Construction of the linear codes with a few weights and determination
of their parameters are an important research topic in coding theory. In this
paper, we construct two classes of linear codes with a few weights and
determine their complete weight enumerators based on twisted Kloosterman sums