Application of Refined Increasing Difference Property in XOR-based MDS Codes

This paper applies the refined increasing difference property to XOR-based MDS codes and obtains a lower storage complexity for distributed storage nodes. For a message of kL bits stored in n distinct storage nodes, a data collector connects any k out of the n storage nodes to recover the message. In this scheme, there is no transmission overhead, that is the bits transmitted to the data collector is exactly the bit number of the message. In addition, the recovery algorithm is within XOR operations so that the decoding complexity is low. But we need less storage than previous scheme.