Binary MDS Array Codes with Flexible Array Dimensions and Their Fast Encoding

In this short paper, we will provide a new explicit construction of binary MDS array codes with triple parities from their parity-check matrices, which contains array codes with array number 8 (8 bits=1 byte). In addition, to demonstrate the applicability of our MDS array codes, we present an effective decoding method aimed at the erased errors. Furthermore, a fast encoding algorithm of our extended MDS array codes is also explored, whose computational complexity is 2 XORs per bit when their code lengths approach infinity.