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 - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial 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<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

The full text electronic article is available for purchase. You will be able to download the full text electronic article after payment.

$54.38 plus tax      Refund Policy

 

OR

Back to top

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages.
Page Help Click here for Page Help
Shopping cart
Tools
Sign in






Need to register?
Sign up here
Text size: A | A | A | A