Recovery and Repair Schemes for Shift-XOR Regenerating Codes

by   Ximing Fu, et al.

Recovery and repair schemes are proposed for shift-exclusive-or (shift-XOR) product-matrix (PM) regenerating codes, which outperform those of the existing PM codes in terms of both communication and computation costs. In particular, for the minimum bandwidth regenerating (MBR) codes, our recovery and repair schemes have the optimal transmission bandwidth, zero decoding auxiliary data space and lower time complexity; for the minimum storage regenerating (MSR) codes, our recovery and repair schemes have smaller transmission bandwidth, smaller decoding auxiliary data space and lower time complexity. Moreover, our schemes involve only XOR operations in recovery and repair and are practical for system implementation. Technically, a procedure is first proposed for solving a system of shift-XOR equations, which plays a similar fundamental role as Gaussian elimination for solving systems of linear equations, and is of independent interest. The recovery and repair of shift-XOR MBR/MSR codes are then decomposed into a sequence of systems of shift-XOR equations, and hence can be solved by a sequence of calls to the procedure for solving a system of shift-XOR equations. As the decomposition of the recovery and repair depends only on the PM construction, but not the specific shift and XOR operations, our recovery and repair schemes can be extended to other MBR/MSR codes using the PM construction.


page 1

page 2

page 3

page 4


On the I/O Costs of Some Repair Schemes for Full-Length Reed-Solomon Codes

Network transfer and disk read are the most time consuming operations in...

Cascade Codes For Distributed Storage Systems

A novel coding scheme for exact repair-regenerating codes is presented i...

Repairing Generalized Reed-Muller Codes

In distributed storage systems, both the repair bandwidth and locality a...

Code Constructions for Distributed Storage With Low Repair Bandwidth and Low Repair Complexity

We present the construction of a family of erasure correcting codes for ...

Near-optimal Repair of Reed-Solomon Codes with Low Sub-packetization

Minimum storage regenerating (MSR) codes are MDS codes which allow for r...

Repairing Reed-Solomon Codes via Subspace Polynomials

We propose new repair schemes for Reed-Solomon codes that use subspace p...

Node repair on connected graphs

We study the problem of erasure correction (node repair) for regeneratin...

Please sign up or login with your details

Forgot password? Click here to reset