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 2):
The RS error correction decoding method according to  claim 1 , wherein the error correction decoding process includes:\n assuming that s is the maximum number of error correction bits of the receiving terminal, let t=2s+1; dividing the code word polynomial Q(x) by the generator polynomial G(x) to obtain the remainder polynomial R(x), R \ue8a0 ( x ) = \u2211 i = 0 2 \ue89e s \ue89e T i \u00b7 x i ; calculating the coefficients of the remainder polynomial R(x), thus obtaining the code words T n  of 2s+1 redundant codes, n=1, 2, . . . , 2s+1; sending, by the sending terminal, information data and 2s+1 redundant codes to the receiving terminal; receiving, by the receiving terminal, the information data and 2s+1 redundant codes; obtaining, by the receiving terminal, the code word polynomial Q(x) according to the received information data and 2s+1 redundant codes, and the code word polynomial Q(x) being represented as: Q \ue8a0 ( x ) = \u2211 l = 2 \ue89e s + 1 2 \ue89e s + k \ue89e K l \u00b7 x l + \u2211 n = 0 2 \ue89e s \ue89e T n \u00b7 x n ; calculating, by the receiving terminal, 2s+1 correctors S i , wherein S i =Q(\u03b1 i ), i=1, 2, . . . , 2s+1; calculating a location of an error information code and a correction value using correctors S 1 to S 2s , if not all of the correctors S, are equal to 0; adding the correction value to the code word at the location of the error information code received by the receiving terminal to obtain an error-corrected code word; assigning the value of the error-corrected code word to the code word at the location of the error information code; recalculating S 2s+1 =Q(\u03b1 2s+1 ), wherein if S 2s+1 =0, the error correction is successful.

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.3015108318260683
- 35 USC 102 Novelty (BERT): 0.5022246102796761
- Combined Prediction Score: 0.3215822096714291
- Mean Citation Score: 245.76922
- Max Citation Score: 257.6457
- Similarity Product: 192.59240346881745

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