The following gives the primitive polynomials with the least number of terms which may be used to generate an autonomous maximum length pseudo random sequence (an M-sequence) from an n-stage linear feedback shift register (LFSR). Alternatives are possible in many cases, particularly as n increases. Recall from Chapter 3 that the primitive polynomial has the form: 1 + a₁x¹ + a₂x² ... a_nxⁿ.

Inspec keywords: random sequences; shift registers; polynomials

Other keywords: linear feedback shift register; LFSR; primitive polynomial; pseudo random sequence

Subjects: Algebra, set theory, and graph theory