Subfield codes of linear codes from perfect nonlinear functions and their duals

12/11/2020

∙

by   Dabin Zheng, et al.

∙

0

∙

share

Let 𝔽_p^m be a finite field with p^m elements, where p is an odd prime and m is a positive integer. Recently, <cit.> and <cit.> determined the weight distributions of subfield codes with the form 𝒞_f={(( Tr_1^m(a f(x)+bx)+c)_x ∈𝔽_p^m, Tr_1^m(a)) : a,b ∈𝔽_p^m, c ∈𝔽_p} for f(x)=x^2 and f(x)=x^p^k+1, respectively, where k is a nonnegative integer. In this paper, we further investigate the subfield code 𝒞_f for f(x) being a known perfect nonlinear function over 𝔽_p^m and generalize some results in <cit.>. The weight distributions of the constructed codes are determined by applying the theory of quadratic forms and the properties of perfect nonlinear functions over finite fields. In addition, the parameters of the duals of these codes are also determined. Several examples show that some of our codes and their duals have the best known parameters with respect to the code tables in <cit.>. The duals of some proposed codes are optimal with respect to the Sphere Packing bound if p≥ 5.