Orthogonal Arrays, Primitive Trinomials, and Shift-Register Sequences
Author: Shiue A.P.J.S.
Source: Finite Fields and Their Applications, Volume 4, Number 3, July 1998 , pp. 252-260(9)
Publisher: Academic Press
Key:
- Free Content
- New Content
- Subscribed Content
- Free Trial Content
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<n
2m+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.
Language: English
Document Type: Research article
Key:
- Free Content
- New Content
- Subscribed Content
- Free Trial Content

Click here for Page Help