# Irreducible polynomial

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2012

2012

- Math. Comput.
- 2012

P. Turán asked if there exists an absolute constant C such that for every polynomial f ∈ Z[x] there exists an irreducible… (More)

Is this relevant?

2011

2011

- IEEE International Symposium on Information…
- 2011

A general class of polynomial remainder codes is considered. These codes are very flexible in rate and length and include Reed… (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- IEEE Transactions on Computers
- 2004

Representing the field elements with respect to the polynomial (or standard) basis, we consider bit parallel architectures for… (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- IEEE Trans. Computers
- 2003

The state-of-the-art Galois field GF ð2Þ multipliers offer advantageous space and time complexities when the field is generated… (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- 1998

finite fields, irreducible polynomials A table of low-weight irreducible polynomials over the finite field F2 is presented. For… (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- Math. Comput.
- 1997

Weil’s character sum estimate is used to study the problem of constructing generators for the multiplicative group of a finite… (More)

Is this relevant?

1997

1997

- ISSAC
- 1997

We describe an efficient method for expressing, from its Galois group, each root of an irreducible polynomial in terms of a… (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- SODA
- 1993

An algorithm is presented that constructs an irreducible polynomial of specified degree n over a finite field F,. The algorithm… (More)

Is this relevant?

Highly Cited

1988

Highly Cited

1988

- FOCS
- 1988

We present a new algorithm for finding an irreducible polynomial of specified degree over a finite field. Our algorithm is… (More)

Is this relevant?

Highly Cited

1982

Highly Cited

1982

- 1982

In this paper we present a polynomial-time algorithm to solve the following problem: given a non-zero polynomial f e Q[X] in one… (More)

Is this relevant?