Five-weight codes from three-valued correlation of M-sequences
Journal article, Peer reviewed
Accepted version
Permanent lenke
https://hdl.handle.net/11250/3126929Utgivelsesdato
2023Metadata
Vis full innførselSamlinger
- Department of Informatics [978]
- Registrations from Cristin [10237]
Originalversjon
Advances in Mathematics of Communications. 2023, 17 (4), 799-814. 10.3934/amc.2021022Sammendrag
In this paper, for each of six families of three-valued m-sequence correlation, we construct an infinite family of five-weight codes from trace codes over the ring R = F2 + uF2, where u2 = 0. The trace codes have the algebraic structure of abelian codes. Their Lee weight distribution is computed by using character sums. Their support structure is determined. An application to secret sharing schemes is given. The parameters of the binary image are [2m+1(2m − 1), 4m, 2m(2m − 2r)] for some explicit r.