When.com Web Search

  1. Ads

    related to: table of primitive polynomials practice

Search results

  1. Results From The WOW.Com Content Network
  2. Primitive polynomial (field theory) - Wikipedia

    en.wikipedia.org/wiki/Primitive_polynomial...

    In finite field theory, a branch of mathematics, a primitive polynomial is the minimal polynomial of a primitive element of the finite field GF(p m).This means that a polynomial F(X) of degree m with coefficients in GF(p) = Z/pZ is a primitive polynomial if it is monic and has a root α in GF(p m) such that {,,,,, …} is the entire field GF(p m).

  3. Conway polynomial (finite fields) - Wikipedia

    en.wikipedia.org/wiki/Conway_polynomial_(finite...

    The primitive polynomial for α is the monic polynomial of smallest possible degree with coefficients in F p that has α as a root in F p n (the minimal polynomial for α). It is necessarily irreducible. The Conway polynomial is chosen to be primitive, so that each of its roots generates the multiplicative group of the associated finite field.

  4. Primitive part and content - Wikipedia

    en.wikipedia.org/wiki/Primitive_part_and_content

    A polynomial is primitive if its content equals 1. Thus the primitive part of a polynomial is a primitive polynomial. Gauss's lemma for polynomials states that the product of primitive polynomials (with coefficients in the same unique factorization domain) also is primitive. This implies that the content and the primitive part of the product of ...

  5. Linear-feedback shift register - Wikipedia

    en.wikipedia.org/wiki/Linear-feedback_shift_register

    The following table lists examples of maximal-length feedback polynomials (primitive polynomials) for shift-register lengths up to 24. The formalism for maximum-length LFSRs was developed by Solomon W. Golomb in his 1967 book. [ 10 ]

  6. Primitive element (finite field) - Wikipedia

    en.wikipedia.org/wiki/Primitive_element_(finite...

    In this case, a primitive element is also called a primitive root modulo q. For example, 2 is a primitive element of the field GF(3) and GF(5), but not of GF(7) since it generates the cyclic subgroup {2, 4, 1} of order 3; however, 3 is a primitive element of GF(7). The minimal polynomial of a primitive element is a primitive polynomial.

  7. Finite field arithmetic - Wikipedia

    en.wikipedia.org/wiki/Finite_field_arithmetic

    A monic irreducible polynomial of degree n having coefficients in the finite field GF(q), where q = p t for some prime p and positive integer t, is called a primitive polynomial if all of its roots are primitive elements of GF(q n). [2] [3] In the polynomial representation of the finite field, this implies that x is a primitive element.