International Association
for Cryptologic Research

We contribute to the knowledge of linear codes with few weights from special polynomials and functions. Substantial efforts (especially due to C. Ding) have been directed towards their study in the last past years. Such codes have several applications in secret sharing, authentication codes, association schemes and strongly

regular graphs. Based on a generic construction of linear codes from mappings and by employing weakly regular bent functions, we provide new class of linear $p$-ary codes with three weights given with its weight distribution. The class of codes presented in this paper is different from those known in the literature. Also, it contains some optimal codes meeting certain bound on linear codes