In this paper, for an odd prime p, some p-element three-weight linear codes are constructed by defining set, and the complete weight enumerators of those codes are determined by using Weil sums over the finite field Fp. Furthermore, it is proved that those codes are minimal under certain conditions, and thus suitable for secret sharing schemes.
Especially, a class of those codes with parameters [p2−1,3,p2−p−1] are obtained, which are optimal with respect to the Griesmer bound. Our results can be regarded as improvements to some results of Jian et al. in [1].
In this paper, two new classes of primitive Evans triangles are constructed by using
the positive integer solutions of the quadratic equation \ kx2−ly2=2,
and the trilateral forms and corresponding Evans ratios of these kinds of Evans triangles are given.