Learn More
Motivated by recent results on the constructions of permutation polynomials with few terms over the finite field 𝔽 2 n ${\mathbb F}_{2^n}$ , where n is a positive even integer, we focus on the construction of permutation trinomials over 𝔽 2 n ${\mathbb F}_{2^n}$ from Niho exponents. As a consequence, several new classes of permutation trinomials over 𝔽 2(More)
Linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, several classes of p-ary linear codes with two or three weights are constructed from quadratic Bent functions over the finite field F p , where p is an odd prime. They include some earlier linear codes as(More)
Linear codes with a few weights have applications in consumer electronics, communication, data storage system, secret sharing, authentication codes, association schemes, and strongly regular graphs. This paper first generalizes the method of constructing two-weight and three-weight linear codes of Ding et al. and Zhou et al. to general weakly regular bent(More)
In this paper, a construction of codebooks based on a set of bent functions satisfying certain conditions is introduced. It includes some earlier constructions of codebooks meeting the Levenstein bound as special cases. With this construction, two new families of codebooks achieving the Levenstein bound are obtained. The codebooks constructed in this paper(More)