More Constructions of 3-Weight Linear Codes

Abstract

Linear codes with few weights have become an interesting research topic and important applications of cryptography and coding theory. In this paper, we apply some ternary near-bent and 2-plateaued functions or r-ary functions to construct more 3-weight linear codes, where r is a prime. Moreover, we determine the weight distributions of the resulted linear codes by means of some exponential sums.