Introduction to finite fields and their applications
Introduction to finite fields and their applications
Primitive normal polynomials over finite fields
Mathematics of Computation
Shift Register Sequences
Irreducible trinomials over finite fields
Mathematics of Computation
Orthogonal Arrays, Primitive Trinomials, and Shift-Register Sequences
Finite Fields and Their Applications
Divisibility of polynomials over finite fields and combinatorial applications
Designs, Codes and Cryptography
| Hi-index | 0.00 |
Consider a maximum-length binary shift-register sequence generated by a primitive polynomial f of degree m. Let $$C_n^f$$ denote the set of all subintervals of this sequence with length n, where m n 驴 2m, together with the zero vector of length n. Munemasa (Finite fields Appl, 4(3): 252---260, 1998) considered the case in which the polynomial f generating the sequence is a trinomial satisfying certain conditions. He proved that, in this case, $$C_n^f$$ corresponds to an orthogonal array of strength 2 that has a property very close to being an orthogonal array of strength 3. Munemasa's result was based on his proof that very few trinomials of degree at most 2m are divisible by the given trinomial f. In this paper, we consider the case in which the sequence is generated by a pentanomial f satisfying certain conditions. Our main result is that no trinomial of degree at most 2m is divisible by the given pentanomial f, provided that f is not in a finite list of exceptions we give. As a corollary, we get that, in this case, $$C_n^f$$ corresponds to an orthogonal array of strength 3. This effectively minimizes the skew of the Hamming weight distribution of subsequences in the shift-register sequence.