PATENT CLAIM ANALYSIS

Application Number: 15864123
Application Type: Utility
Filing Date: 2018-01
Publication Date: 2019-07
Patent Classification: ["714", "006210"]

Abstract:
Aspects of the invention include receiving data that includes a group of n symbols to be written to a plurality of storage units. The group of symbols is mapped into a codeword of n+k symbols, each assigned to one of the storage units. The codeword is configured to allow at least one of the n symbols to be reconstructed using a subset of the n+k symbols. At least one of the n+k symbols is assigned to one of the storage units based at least in part on content of the at least one of the n+k symbols. Writing each of the n+k symbols to its assigned storage unit in the plurality of storage units is initiated. The writing includes optimizing storage capacity of the assigned storage unit based at least in part on determining that the symbol has the same content as another symbol previously stored in the storage unit.

Claim (Index 2):
The method of  claim 1 , wherein all of the n+k symbols are assigned to a different one of the plurality of storage units based at least in part on their content.

Metadata:
- Claim Count in Document: 2.0
- Percentile: 86.0
- Lexical Diversity: 2.7069
- Patent Class: 714.0
- Transitional Phrase Type: none
- Component Type: 0
- Foreign Priority: False
- Related Applications: ['14167389', '15211208', '14122404', '14236270', '12906770']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.3244752237751961
- 35 USC 102 Novelty (BERT): 0.4925305226401478
- Combined Prediction Score: 0.3412807536616913
- Mean Citation Score: 210.554364
- Max Citation Score: 216.09077
- Similarity Product: 144.46116332924905

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

Dataset: test