Recurrent methods for constructing irreducible polynomials over Fq of odd characteristics, II

Authors:
Melsik K. Kyuregyan
Affiliations:
Institute for Informatics and Automation Problems, National Academy of Sciences RA,1, P. Sevak str., 375014 Yerevan, Armenia
Venue:
Finite Fields and Their Applications
Year:
2006

Citing 4
Cited 2

The explicit construction of irreducible polynomials over finite fields

Designs, Codes and Cryptography
Explicit N-polynomials of 2-power degree over finite fields, I.

Designs, Codes and Cryptography
Completely Normal Elements in Iterated Quadratic Extensions of Finite Fields

Finite Fields and Their Applications
Recurrent methods for constructing irreducible polynomials over Fq of odd characteristics

Finite Fields and Their Applications

Irreducible compositions of polynomials over finite fields

Designs, Codes and Cryptography
A recurrent method for constructing irreducible polynomials over finite fields

CASC'11 Proceedings of the 13th international conference on Computer algebra in scientific computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper computationally easy explicit constructions of sequences of irreducible and normal monic polynomials over finite fields of odd characteristic are presented.