Pages that link to "Item:Q1311621"

The following pages link to Finding irreducible and primitive polynomials (Q1311621):

Displaying 13 items.

• Bounded distance decoding of linear error-correcting codes with Gröbner bases (Q733503) (← links)
• Search of primitive polynomials over finite fields (Q749611) (← links)
• Parity of the number of irreducible factors for composite polynomials (Q973959) (← links)
• Univariate polynomial factorization over finite fields (Q1127311) (← links)
• On finding primitive roots in finite fields (Q1351512) (← links)
• On the construction of irreducible and primitive polynomials from \(\mathbb{F}_{q^m} [x]\) to \(\mathbb{F}_q [x]\) (Q2066396) (← links)
• Sequences of irreducible polynomials over odd prime fields via elliptic curve endomorphisms (Q2406723) (← links)
• Computational aspects of retrieving a representation of an algebraic geometry code (Q2437321) (← links)
• Efficient indexing of necklaces and irreducible polynomials over finite fields (Q2816411) (← links)
• Fast algorithm for finding primitive polynomials over GF(q) (Q4006408) (← links)
• Fast construction of irreducible polynomials over finite fields (Q5906578) (← links)
• Fast construction of irreducible polynomials over finite fields (Q5917943) (← links)
• Factoring polynomials over finite fields: A survey (Q5928877) (← links)