Orthogonal Arrays, Primitive Trinomials, and Shift-Register Sequences

In this: publication
By this: publisher
In this Subject: <a title="Mathematics and Statistics" href="/content/subcat?j_subject=195&j_availability=">Mathematics and Statistics
By this author: Shiue A.P.J.S.

Author: Shiue A.P.J.S.

Source: Finite Fields and Their Applications, Volume 4, Number 3, July 1998 , pp. 252-260(9)

Buy & download fulltext article:

Price: $52.63 plus tax (Refund Policy)

Abstract:

We investigate properties of maximum-length binary shift-register sequences defined by primitive trinomials. We consider the set of subintervals of length n of such a sequence for m<n2m+1, where m is the degree of the trinomial. This set is an orthogonal array of strength 2 and is shown to have a property very close to being an orthogonal array of strength 3. Copyright 1998 Academic Press.