PATENT CLAIM ANALYSIS

Application Number: 15871939
Application Type: Utility
Filing Date: 2018-01
Publication Date: 2018-05
Patent Classification: ["714", "784000"]

Abstract:
A decoding method includes that when encoding at a sending terminal, for a m-order primitive polynomial P(x), a primitive field element in galois field GF(2 m ) is represented by α; a lookup table f(α j ) for different power exponents of α is established, where the value of j is selected from all the integers ranging from 0 to 2m−1, with a total number of 2m; a generator polynomial G(x) is expanded to obtain a polynomial with respect to x, with coefficients being an addition or subtraction of the power exponents of α; a remainder polynomial R(x), obtained by dividing code word polynomial Q(x) by the generator polynomial G(x), is a polynomial with respect to x, with coefficients being an addition or subtraction of the power exponents of α; and the coefficients of the generator polynomial G(x) and the remainder polynomial R(x) are both calculated using data found in the lookup table f(α j ).

Claim (Index 5):
The RS error correction decoding method according to  claim 4 , wherein looking for the location in the code word polynomial Q(x) corresponding to the location of the error information code specifically includes:\n finding out the numerical value in the lookup table f(\u03b1 j ) that is the same as the value of the error information code, the coefficient at the location where the exponent value of x in the polynomial Q(x) is equal to the exponent value of \u03b1 corresponding to the numerical value is the location in the code word polynomial Q(x) corresponding to the error information code; if the numerical value that is the same as the value of the error information code is not found in the lookup table f(\u03b1 j ), the following method is used to find out the location of the error information code, specifically: S1, taking p=2*m\u22121=31, v=\u03b1 2m\u22121 ; S2, letting p=p+1; S3, if the highest data bit of v is 1, shifting v leftward by 1 bit firstly, and then v=v+v 0 , wherein v 0  is the numerical value obtained by bringing x=\u03b1 into the primitive polynomial P(x) except for the term of the highest power of x; if the highest data bit of v is 0, shifting v leftward by 1 bit; S4, comparing the v obtained in step S3 with the error information code to see whether they are equal: If the v is equal to the error information code, the coefficient corresponding to the p th  power of x in the code word polynomial Q (x) is the location of the error information code. If the v is not equal to the error information code, then turn to step S2 to continue the process.

Metadata:
- Claim Count in Document: 7.0
- Percentile: 86.0
- Lexical Diversity: 2.39024
- Patent Class: 714.0
- Transitional Phrase Type: none
- Component Type: 0
- Foreign Priority: True
- Related Applications: ['11105420', '12479605', '09822950', '10632125', '12046049']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.3012969037758425
- 35 USC 102 Novelty (BERT): 0.5034122133434916
- Combined Prediction Score: 0.3215084347326074
- Mean Citation Score: 245.76922
- Max Citation Score: 257.6457
- Similarity Product: 189.14556701399087

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

Dataset: test