In this paper we resolve an open problem about decoding cyclic codes over the ring F2+uF2 with u2 = 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 F2[u] huti = F2 + uF2 + u2F2 + ¢ ¢ ¢ + ut¡1F2, where ut = 0:
