Abstract: An improved technique involves assigning a different generator matrix to each data stripe of the redundant disk array such that all of the different generator matrices represent the same code. For example, when a k×n generator matrix G represents a linear code C, k being the block length and n the code length, then for any invertible k×k matrix P, the matrix G?=PG is also a generator that represents C. When C is a systematic code, then G consists of a k×k identity matrix representing payload data concatenated with a k×(n?k) parity matrix representing parity data. Certain matrices P represent row operations on G, meaning that the matrix G? may have the columns of the identity matrix in G to different locations in G?.

Abstract: An improved technique involves assigning a different generator matrix to each data stripe of the redundant disk array such that all of the different generator matrices represent the same code. For example, when a k×n generator matrix G represents a linear code C, k being the block length and n the code length, then for any invertible k×k matrix P, the matrix G?=PG is also a generator that represents C. When C is a systematic code, then G consists of a k×k identity matrix representing payload data concatenated with a k×(n?k) parity matrix representing parity data. Certain matrices P represent row operations on G, meaning that the matrix G? may have the columns of the identity matrix in G to different locations in G?.