System minimum storage regeneration code based local repair encoding method
A technology of storage regeneration and coding method, which is applied in the field of local repair coding, and can solve problems such as not considering node storage overhead
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment
[0071] This embodiment is to construct (7,4 system) system MSR code in finite field GF(8), using m=[m 1 m 2 m 3 m 4 ] Represents the original information data of the storage node in the distributed storage system, where m 1 ,m 2 ,...,M 4 Indicates information symbol; c=[c 1 c 2 …C 7 ] Represents the generated codeword of the system MSR code stored in the distributed storage node, and c=m·G MSR , Here (7,4) system MSR code generator matrix G MSR =[I|P] 4×7 , Where I is a 4×4 unit matrix, and P is a 4×3 dimensional sub-matrix. (7,4) The system MSR code can be expressed as
[0072] c=m·G MSR =m·[I|P] 4×7 =[m|mP]
[0073] (7,4) The structure of the system MSR code can be expressed as:
[0074] Storage node
m
mP
[0075] Let α 1 ,α 2 ,α 3 Is the 3 non-zero elements in GF(8), then the generator matrix of the (7,4) system MSR code is
[0076] G M S R = [ I | P ] 4 X 7 = 1 0 0 0 1 1 1 0 1 0 0 ...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com