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

Buy & download fulltext article:

OR

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<nle2m+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

Publication date: 1998-07-01

Related content

Tools

Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content

Text size:

A | A | A | A
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages. print icon Print this page