Orthogonal Arrays, Primitive Trinomials, and Shift-Register Sequences

Research output: Contribution to journalArticlepeer-review

13 Citations (Scopus)

Abstract

We investigate properties of maximum-length binary shift-register sequences defined by primitive trinomials. We consider the set of subintervals of lengthnof such a sequence form<n≤2m+1, wheremis 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.

Original languageEnglish
Pages (from-to)252-260
Number of pages9
JournalFinite Fields and their Applications
Volume4
Issue number3
DOIs
Publication statusPublished - 1998 Jul
Externally publishedYes

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Algebra and Number Theory
  • Engineering(all)
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Orthogonal Arrays, Primitive Trinomials, and Shift-Register Sequences'. Together they form a unique fingerprint.

Cite this