Data codec method based on binary reed-solomon code
A technology of Reed-Solomon codes and encoding and decoding methods, applied in the field of distributed storage systems, can solve the problems of large storage capacity of node data, high computational complexity, complex system structure, etc., and achieve increased speed, fast update speed, and reduced The effect of cost consumption
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0016] The present invention will be further described below with reference to the accompanying drawings and specific embodiments.
[0017] The traditional Reed-Solomon code construction is based on finite field GF(q). In order to reduce the complexity of Reed-Solomon, we propose a binary-field-based Reed-Solomon Code (BinaryReed-SolomonCode, abbreviated as BRS code) ; We know that for k original data blocks (length Lbit), let s i,j represents the data block s i The value of the jth bit in the i =s i,1 s i,2 ...s i,L , i=0,1,2,...,k-1. The difficulty lies in successfully finding n-k independent check data blocks, so that any k data blocks in the n data blocks (including original data blocks and check data blocks) are linearly independent. In general, we call data blocks that satisfy the above conditions (n, k) independent.
[0018] For example, take a file S={s 0 ,s 1}, contains two original data blocks s 0 , s 1 . It can be clearly seen that using XOR coding, ther...
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