Linear codes with few weights from weakly regular bent functions based on a generic construction
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 past few 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 a 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 literature.
Cryptography and Communications