Optimal three-weight cubic codes

In this paper, we construct an infinite family of three-weight binary codes from linear codes over the ring $R=\mathbb{F}2+v\mathbb{F}2+v^{2\mathbb{F}_2$,} where $v^3=1.$ These codes are defined as trace codes. They have the algebraic structure of abelian codes. Their Lee weight distributions are computed by employing character sums. The three-weight binary linear codes which we construct are shown to be optimal when $m$ is odd and $m>1$. They are cubic, that is to say quasi-cyclic of co-index three. An application to secret sharing schemes is given.