Irreducible Polynomials Generated by Decimations

Fritz von Haeseler () and Wibke Jürgensen ()
Additional contact information
Fritz von Haeseler: University of Bremen, CeVis
Wibke Jürgensen: University of Bremen, Departmentof Mathematics and Computer Science

A chapter in Finite Fields and Applications, 2001, pp 224-231 from Springer

Abstract: Abstract Several methods are known, to construct irreducible polynomial over a finite field from known ones. We present a simple approach based on decimations of polynomial, which generalizes an algorithm presented by S. Golomb, and also show its relevance for the generation of primitive polynomials.

Date: 2001
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-56755-1_18

Ordering information: This item can be ordered from
http://www.springer.com/9783642567551

DOI: 10.1007/978-3-642-56755-1_18

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().