Skip to main content
Conference Proceedings

Construction of irreducible polynomials over finite fields

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2010) 6244 LNCS 1-3
DOI: 10.1007/978-3-642-15274-0_1
0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The aim of this paper is to present an explicit construction of families of irreducible polynomials over finite fields by applying a polynomial composition method. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Abrahamyan, S. (2010). Construction of irreducible polynomials over finite fields. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6244 LNCS, pp. 1–3). https://doi.org/10.1007/978-3-642-15274-0_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free