Create a representation of GF(size) using the given primitive polynomial.
irreducible polynomial whose coefficients are represented by the bits of an int, where the least-significant bit represents the constant coefficient
the size of the field
irreducible polynomial whose coefficients are represented by the bits of an int, where the least-significant bit represents the constant coefficient
the size of the field
the monomial representing coefficient * x^degree
2 to the power of a in GF(size)
multiplicative inverse of a
base 2 log of a in GF(size)
product of a and b in GF(size)
Implements both addition and subtraction -- they are the same in GF(size).
sum/difference of a and b
Generated using TypeDoc
This class contains utility methods for performing mathematical operations over the Galois Fields. Operations use a given primitive polynomial in calculations.
Throughout this package, elements of the GF are represented as an {@code int} for convenience and speed (but at the cost of memory).
Sean Owen
David Olivier