- Full text PDF available (11)
- This year (0)
- Last 5 years (2)
- Last 10 years (7)
Journals and Conferences
A covering array CA(N ; t, k, v) is an N × k array such that every N × t sub-array contains all t-tuples from v symbols at least once, where t is the strength of the array. Covering arrays are used to generate software test suites to cover all t-sets of component interactions. The particular case when t = 2 (pairwise coverage) has been extensively studied,… (More)
We obtain an equivalent version of Carlitz’s formula for the number of monic irreducible polynomials of degree n and trace = 0 over a finite field via an integer recurrence. Similar expressions for the =0 case are also given. We also obtain formulas for the number of monic irreducible polynomials of degree n and prescribed constant term. © 2005 Elsevier… (More)
We give, over a finite field Fq, explicit factorizations into a product of irreducible polynomials, of the cyclotomic polynomials of order 3 · 2, the Dickson polynomials of the first kind of order 3 · 2 and the Dickson polynomials of the second kind of order 3 · 2 − 1.
We give new descriptions of the factors of Dickson polynomials over finite fields.
Reversed Dickson polynomials over finite fields are obtained from Dickson polynomials Dn(x, a) over finite fields by reversing the roles of the indeterminate x and the parameter a. We study reversed Dickson polynomials with emphasis on their permutational properties over finite fields. We show that reversed Dickson permutation polynomials (RDPPs) are… (More)