Codes with few weights arising from linear sets

From MaRDI portal



Abstract: In this article we present a class of codes with few weights arising from special type of linear sets. We explicitly show the weights of such codes, their weight enumerator and possible choices for their generator matrices. In particular, our construction yields also to linear codes with three weights and, in some cases, to almost MDS codes. The interest for these codes relies on their applications to authentication codes and secret schemes, and their connections with further objects such as association schemes and graphs.


In this paper, a class of linear codes with few weights arising from a special type of linear sets is presented. The authors show that h-scattered linear sets of maximum rank provide families of point sets with few intersection numbers with respect to hyperplanes, yielding codes (equipped with Hamming distance) with few weights. In addition, the weight of such codes, their weight enumerators and possible choices for their generator matrices are derived. In particular, it is shown how this general construction yields to obtain linear codes with three weights which are almost MDS codes.



Cites work









This page was built for publication: Codes with few weights arising from linear sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6112236)