$AZTEC_DATA_12
$AZTEC_DATA_12
<p>This class contains utility methods for performing mathematical operations over the Galois Fields. Operations use a given primitive polynomial in calculations.</p>
Throughout this package, elements of the GF are represented as an {@code int} for convenience and speed (but at the cost of memory).
$expTable : array
$logTable : array
$zero : \Zxing\Common\Reedsolomon\GenericGFPoly
$one : \Zxing\Common\Reedsolomon\GenericGFPoly
__construct(\Zxing\Common\Reedsolomon\irreducible $primitive, \Zxing\Common\Reedsolomon\the $size, \Zxing\Common\Reedsolomon\the $generatorBase) : mixed
Create a representation of GF(size) using the given primitive polynomial.
| \Zxing\Common\Reedsolomon\irreducible | $primitive | polynomial whose coefficients are represented by the bits of an int, where the least-significant bit represents the constant coefficient |
| \Zxing\Common\Reedsolomon\the | $size | size of the field |
| \Zxing\Common\Reedsolomon\the | $generatorBase | factor b in the generator polynomial can be 0- or 1-based (g(x) = (x+a^b)(x+a^(b+1))...(x+a^(b+2t-1))). In most cases it should be 1, but for QR code it is 0. |