PATENT CLAIM ANALYSIS

Application Number: 15977794
Application Type: Utility
Filing Date: 2018-05
Publication Date: 2018-09
Patent Classification: ["714", "006240"]

Abstract:
This application discloses a storage controller. When running, the storage controller encodes, according to a check matrix, K to-be-coded data chunks obtained from a client, to generate two check chunks. In this way, if any chunk is damaged subsequently, the damaged chunk may be recovered by using the check matrix and an undamaged chunk.

Claim (Index 14):
A computer-readable storage medium comprising instructions which, when executed by a computer, cause the computer to:\n obtain K to-be-coded data chunks, and cache the K to-be-coded data chunks, wherein each data chunk of the K to-be-coded data chunks comprises R data code blocks, R+1 is a prime number, and R+1>K; and generate a first check chunk and a second check chunk according to a check matrix and the K to-be-coded data chunks, wherein each of the first check chunk and the second check chunk comprises R check code blocks; wherein the check matrix comprises 2*R rows, the ((k\u22121)*R+1) th  column to the (k*R) th  column of the check matrix form a chunk column set of the k th  data chunk in the K data chunks, wherein K\u2265k\u22651, and wherein the (K*R+1) th  column to the ((K+1)*R) th  column of the check matrix form a chunk column set of the first check chunk, and the ((K+1)*R+1) th  column to the ((K+2)*R) th  column of the check matrix form a chunk column set of the second check chunk; and wherein the check matrix is a standard check matrix H, or the check matrix is obtained after N exchange operations are performed on a standard check matrix H, wherein N\u22651, and each of the N exchange operations is an exchange of any two chunk column sets; and wherein in the standard check matrix H, 2*R\u2265i\u22651, and (K+2)*R\u2265j\u22651, and the following coordinates are 1 and the remaining coordinates are 0: when i<j, H[i+1][j*R+(R\u2212j+i)mod R+1], and H[R+i+1][(j+1)*R\u2212(R\u2212j+i)mod R]; or when i>j, [H[i+1]j*R+(R\u22121\u2212j+i)mod R+1], and H[R+i+1][(j+1)*R\u2212(R\u22121\u2212j+i)mod R].

Metadata:
- Claim Count in Document: 41.0
- Percentile: 93.0
- Lexical Diversity: 1.5
- Patent Class: 714.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['13996825', '15460119', '10966984', '13190151', '13640568']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.2970667188101916
- 35 USC 102 Novelty (BERT): 0.4901512871070138
- Combined Prediction Score: 0.3163751756398739
- Mean Citation Score: 219.847278
- Max Citation Score: 236.84859
- Similarity Product: 180.13124752753257

Labels:
- Claim Label 101: 0
- Claim Label 102: 1
- Claim Label 103: 1
- Claim Label 112: 1
- Combined Label: 0
- Label 101 Adjusted: 0

Dataset: test