Abstract: In this paper, a new data distribution strategy is described, which called the extend EVENODD codes (EEOD codes). It can recover any triple storage nodes failures with only three extra nodes for parity information. The equations are represented by circle paths of graph. Detailed EEOD code's decoding algorithms are proposed for correcting various triple node failures with successive elimination of graph vertex. It shows that the decoding complexity of the EEOD code is much lower than those of the existing comparable codes. The EEOD code is very valuable for storage systems which need higher reliability.