Learn More
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)
Reversed Dickson polynomials over finite fields are obtained from Dickson polynomials D n (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)