Finding irreducible and primitive polynomials
From MaRDI portal
Publication:1311621
DOI10.1007/BF01200150zbMath0797.11094OpenAlexW4240185817MaRDI QIDQ1311621
Publication date: 20 October 1994
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01200150
Number-theoretic algorithms; complexity (11Y16) Polynomials in general fields (irreducibility, etc.) (12E05) Polynomials over finite fields (11T06)
Related Items
On finding primitive roots in finite fields, Univariate polynomial factorization over finite fields, Computational aspects of retrieving a representation of an algebraic geometry code, Factoring polynomials over finite fields: A survey, Parity of the number of irreducible factors for composite polynomials, Bounded distance decoding of linear error-correcting codes with Gröbner bases
Cites Work