Lines Matching refs:coefficients
38 // A table of size 256 * degree, where polynomialMultiply[i][j] = multiply(i, coefficients[j]).
39 // 'coefficients' is the temporary array computed in the constructor.
48 // The divisor polynomial, whose coefficients are stored from highest to lowest power.
50 byte[] coefficients = new byte[degree];
51 coefficients[degree - 1] = 1; // Start off with the monomial x^0
59 for (int j = 0; j < coefficients.length; j++) {
60 coefficients[j] = (byte)multiply(coefficients[j] & 0xFF, root);
61 if (j + 1 < coefficients.length)
62 coefficients[j] ^= coefficients[j + 1];
70 polynomialMultiply[i][j] = (byte)multiply(i, coefficients[j] & 0xFF);