PATENT CLAIM ANALYSIS

Application Number: 15924007
Application Type: Utility
Filing Date: 2018-03
Publication Date: 2018-07
Patent Classification: ["341", "050000"]

Abstract:
An encoding method and apparatus is described. In an encoding method, when a first target sub-block in a target block is obtained, a hash operation is first performed on the first target sub-block. Then, a first hash table is queried for a corresponding hash value according to an operation result, and a corresponding location in a reference block is found according to the hash value obtained by means of query, that is, first reference data is found. The first piece of target data in the first target sub-block is matched with the first reference data, and second target data in the target block is matched with second reference data in the reference block. In this way, an approximate location is predetermined, so that a range in which matching needs to be performed is narrowed, a data compression time is reduced, and data compression efficiency is improved.

Claim (Index 13):
The apparatus according to  claim 8 , wherein the processor is further configured to:\n if the hash value corresponding to the first key value is not found in the first hash table, query a second hash table according to the first key value before generating the first encoding sequence, wherein a hash value that is in the second hash table and that is corresponding to a key value indicates an address of target data; and if the hash value corresponding to the first key value is found in the second hash table, obtain first target data according to the hash value that is in the second hash table and that is corresponding to the first key value, match the first piece of target data in the first target sub-block with the first target data, and match the second target data in the target block with third target data in the target block, wherein the second target data is another piece of target data subsequent to the first piece of target data in the first target sub-block, and the third target data is another piece of target data subsequent to the first target data in the target block; and the first encoding sequence further comprises an indication bit, used to indicate that the data matching the target data that is successfully matched this time is in the target block.

Metadata:
- Claim Count in Document: 29.0
- Percentile: 90.0
- Lexical Diversity: 2.57143
- Patent Class: 341.0
- Transitional Phrase Type: none
- Component Type: 0
- Foreign Priority: True
- Related Applications: ['13116419', '15321536', '13154756', '15176123', '14489676']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.5228591502145493
- 35 USC 102 Novelty (BERT): 0.4817157644792975
- Combined Prediction Score: 0.5187448116410242
- Mean Citation Score: 149.374578
- Max Citation Score: 160.15007
- Similarity Product: 122.53900912388686

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

Dataset: test