Pages that link to "Item:Q1311621"
From MaRDI portal
The following pages link to Finding irreducible and primitive polynomials (Q1311621):
Displaying 6 items.
- Bounded distance decoding of linear error-correcting codes with Gröbner bases (Q733503) (← 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)
- Computational aspects of retrieving a representation of an algebraic geometry code (Q2437321) (← links)
- Factoring polynomials over finite fields: A survey (Q5928877) (← links)
