Lines Matching defs:degree
38 // A table of size 256 * degree, where polynomialMultiply[i][j] = multiply(i, coefficients[j]).
43 // Creates a Reed-Solomon ECC generator polynomial for the given degree.
44 private ReedSolomonGenerator(int degree) {
45 if (degree < 1 || degree > 255)
50 byte[] coefficients = new byte[degree];
51 coefficients[degree - 1] = 1; // Start off with the monomial x^0
53 // Compute the product polynomial (x - r^0) * (x - r^1) * (x - r^2) * ... * (x - r^{degree-1}),
54 // and drop the highest monomial term which is always 1x^degree.
57 for (int i = 0; i < degree; i++) {
67 polynomialMultiply = new byte[256][degree];
69 for (int j = 0; j < degree; j++)
79 int degree = polynomialMultiply[0].length;
80 assert result.length == degree;
85 for (int j = 0; j < degree - 1; j++)
87 result[degree - 1] = table[degree - 1];