Documentation of 'org.jquantlib.math.randomnumbers.PrimitivePolynomials' Java class
PrimitivePolynomials
org.jquantlib.math.randomnumbers

Class PrimitivePolynomials



  • public class PrimitivePolynomials
    extends java.lang.Object
    PMT : Primitive Polynomials Modulo Two

    The encoding is as follows: Coefficients of each primitive polynomial are the bits of the given integer. The leading and trailing coefficients, which are 1 for all of the polynomials, have been omitted.

     Example: The polynomial
    
          4    2
         x  + x  + 1
    
     is encoded as  2  in the array of polynomials of degree 4 because the
     binary sequence of coefficients
    
       10101
    
     becomes
    
        0101
    
     after stripping off the top bit, and this is converted to
    
         010
    
     by right-shifting and losing the rightmost bit. Similarly, we have
    
       5    4    2
      x  + x  + x  + x + 1
    
     encoded as  13  [ (1)1101(1) ]  in the array for degree 5.
     
    • Constructor Detail

      • PrimitivePolynomials

        public PrimitivePolynomials()
      • PrimitivePolynomials

        public PrimitivePolynomials(long ppmtMaxDim)
    • Method Detail

      • get

        public final long get(int i,
                              int j)
      • getPpmtMaxDim

        public final long getPpmtMaxDim()

DataMelt 3.0 © DataMelt by jWork.ORG

You see the box below because you did not login.