In this paper we resolve an open problem about decoding cyclic codes over the ring F2+uF2 with u^2 = 0: This problem was first proposed by AbuAlrub et al. in (Des Codes Crypt 42: 273-287, 2007). Also we extend this decoding procedure for cyclic codes of arbitrary length over the ringe [F^2[u] F_2 + u F_2 + u^2 F_2_ + ... + u^t F_2, where u^t = 0=
