Several classes of linear codes with AMDS duals and their subfield codes

Subfield codes of linear codes over finite fields have recently attracted great attention due to their wide applications in secret sharing, authentication codes and association schemes. In this paper, we first present a construction of 3-dimensional linear codes C f over finite field F 2 m parameterized by any Boolean function f . Then we determine explicitly the weight distributions of C f , the punctured code C ~ f , as well as the corresponding subfield codes over F 2 for several classes of Boolean functions f . In particular, we determine the weight distributions of subfield codes derived from r -plateaued functions. Moreover, the parameters of their dual codes are investigated, which contain length-optimal and dimension-optimal AMDS codes with respect to the sphere packing bound. We emphasize that the new codes are projective and contain binary self-complementary codes. As applications, some of the projective codes we present can be employed to construct s -sum sets for any odd integer s > 1 .