Array codes have been widely used in communication and storage systems. To reduce computational complexity, one important property of the array codes is that only exclusive OR operations are used in the encoding and decoding processes. Cauchy Reed-Solomon codes, Rabin-like codes and circulant Cauchy codes are existing Cauchy maximum-distanceseparable(MDS)arraycodesthatemployCauchymatricesover?nite?elds,circularpermutation matrices and circulant Cauchy matrices, respectively. All these codes can correct any number of failures; however,acriticaldrawbackofexistingcodesisthehighdecodingcomplexity.Inthiswork,weproposeanewconstruction of Rabinlike codes based on a quotient ring with a cyclic structure. The newly constructed Rabin-like codes have moresupportedparameters(primepisextendedtoanoddnumber)suchthattheworldsizesofthemaremore?exiblethantheexistingCauchyMDSarraycodes. Anef?cientdecodingmethodusingLUfactorizationoftheCauchy matrix can be applied to the newly constructed Rabin-like codes. It is shown that the decoding complexity of the proposedapproachislessthanthatofexistingCauchyMDSarraycodes. Hence, theRabin-likecodesbasedonthe newconstructionareattractivetodistributedstoragesystems