Five-weight codes from three-valued correlation of M-sequences

In this paper, for each of six families of three-valued \begin{document}$ m $\end{document} -sequence correlation, we construct an infinite family of five-weight codes from trace codes over the ring \begin{document}$ R = \mathbb{F}_2+u\mathbb{F}_2 $\end{document} , where \begin{document}$ u^2 = 0. $\end{document} 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 \begin{document}$ [2^{m+1}(2^m-1),4m,2^{m}(2^m-2^r)] $\end{document} for some explicit \begin{document}$ r. $\end{document}