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 1):
A RS error correction decoding method, characterized in that,\n when encoding at a sending terminal, code words of information data are represented by K l , code words of redundant codes are represented by T n , the order of primitive polynomial P(x) is m, a generator polynomial in GF(2 m ) is G(x), and an error correction code is represented by (c, k, t), wherein c is the total length of the information data and the redundant code, k is the length of the information data, and t is the length of the redundant code, then the code word polynomial Q(x) can be represented as Q \ue8a0 ( x ) = \u2211 l = t t + k - 1 \ue89e K l \u00b7 x l + \u2211 n = 0 t - 1 \ue89e T n \u00b7 x n ; root of the m-order primitive polynomial P(x) is primitive field element in GF (2 m ), and the primitive field element is represented by \u03b1, thus the generator polynomial G(x) can be represented as G \ue8a0 ( x ) = \u220f i = 1 t \ue89e \ue89e ( x - \u03b1 i ) ; a lookup table f(\u03b1 j ) is established for different power exponents of \u03b1, wherein the value of j is selected from all the integers ranging from 0 to 2m\u22121, with a total number of 2m; the generator polynomial G(x) is expanded to obtain a polynomial with respect to x, wherein the coefficients of the generator polynomial G(x) are the addition or subtraction of the power exponents of \u03b1; numerical values of the different power exponents of \u03b1 are found out through the lookup table f(\u03b1 j ) and the coefficients of the generator polynomial G(x) are calculated; it is assumed that the code words T n  of the redundant codes are all 0, then a code word polynomial Q \ue8a0 ( x ) = \u2211 l = t t + k - 1 \ue89e K l \u00b7 x l is obtained;\n the code word polynomial Q(x) is divided by the generator polynomial G(x) to obtain a remainder polynomial \n R \ue8a0 ( x ) = \u2211 i = 0 2 \ue89e s \ue89e T i \u00b7 x i ; the coefficients Ti of R(x) are the addition or subtraction of the power exponents of \u03b1; numerical values of the power exponents of \u03b1 are found out through the lookup table f(\u03b1 j ), and the coefficients of the remainder polynomial R(x) are calculated, namely, the code words Tn of the redundant codes.

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.301923882667098
- 35 USC 102 Novelty (BERT): 0.4999328291253415
- Combined Prediction Score: 0.3217247773129223
- Mean Citation Score: 245.76922
- Max Citation Score: 257.6457
- Similarity Product: 199.2438215897441

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