Finite field binary addition and shift-based regeneration code fault tolerance method
A binary addition and finite field technology, applied in the field of distributed storage, can solve problems such as unrecoverable data
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0025] Below in conjunction with specific embodiment, further illustrate the present invention, should be understood that these embodiments are only used to illustrate the present invention and are not intended to limit the scope of the present invention, after having read the present invention, those skilled in the art will understand various equivalent forms of the present invention All modifications fall within the scope defined by the appended claims of the present application.
[0026] The embodiment of the present invention discloses a regeneration code error-tolerant method based on finite-field binary addition and shift. The method introduces finite-field operations on the basis of binary addition and shift BASIC regeneration codes to quickly realize encoding and reconstruction and serve BASIC regeneration. The code scheme can cause the problem of unrecoverable data when the determinant of the encoding matrix does not have a multiplicative inverse, and does not introduc...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 