Five-weight codes from three-valued correlation of M-sequences (Q6167297)

The article studies some families of few-weight codes, with a focus on trace codes constructed using binomials of the form \(x + x^d\). These codes are not visibly cyclic but are provably abelian. The authors provide a unified proof that six such binomials yield five-weight binary codes when the ring \(R\) is \(\mathbb{F}_2 + u\mathbb{F}_2\) and the defining set \(L\) is \(R^*_m\). The article also provides results on the dual distance, support structure, and application to secret sharing schemes for these codes.