Talk:Maximum length sequence

Talk

Hi, not sure one could say that the MLS "are" a polynomial ring ( I mean by that there is in the abstract a number of "they" and in my understanding the sequence is not a polynomial as is refered in the "polynomial ring" article. So I would suggest to replace that by "they can be derived" or that some characteristic of the sequence is related to a polynomial ring or such

Regarding the mention of fMRI in the introductory paragraph. The prior version referenced a paper from my laboratory that was not an ideal citation for the m-sequence page. I replaced the citation of my work with that of Buracas that is earlier and more appropriate to a discussion of m-sequences. -- Geoffrey K Aguirre 4/23/2010

• • • • • • • —Preceding unsigned comment added by 96.227.218.221 (talk) 05:11, 23 April 2010 (UTC)

Extraction of impulse responses

This is very unclear. Maybe someone links to referenced material could be sprinkled in. — Preceding unsigned comment added by Brandon.irwin (talk • contribs) 18:59, 17 June 2011 (UTC)

Info on generating the primative polynomials?

It would be very helpful if info about generating the primative polynomials could be added here. For example can a computer algebra system like https://en.wikipedia.org/wiki/PARI/GP generate them? If so, how? Woz2 (talk) 20:05, 6 November 2013 (UTC)

Every binary sequence?

   "they reproduce every binary sequence that can be represented by the shift registers"
   "for length-m registers they produce a sequence of length 2^m − 1"

These two statements seem contradictory, as a shift register of length m can represent 2^m sequences, not 2^m - 1. If I understand correctly, the all-zero sequence is never produced. It is easy to see if you try to start the recursion with only zeros - all subsequent register values will remain zero. 213.3.32.205 (talk) 15:13, 21 November 2013 (UTC)

If the registers are initialised to contain any non-zero values, then the MLS will never produce a sequence of all-zeros. i.e., the registers will never be in a state where they all contain zeros.

So for $m$ registers while there are $2^{m}$ possible sequences, the one which consists of all-zeros is absent from the output of the MLS, leaving $2^{m}-1$.

If the registers are initialised to all-zeros, then the MLS will only produce the sequence of all-zeros. Sawatts (talk) 11:31, 13 November 2014 (UTC)

Merge to Linear-feedback shift register

First of all, I just changed the redirect for PN sequences to go to Linear-feedback shift register. Another pseudonym or synonym for LFSR sequence (besides *"PN sequence"*) is this page (Maximum length sequence).

"LFSR sequences", "PN sequences", "Maximum length sequences" (MLS), and binary "Galois fields" (GF(2)) are all about the same thing. While I certainly do not propose merging this with the Galios field page, the first three should be merged and presented in the Computer science or Electrical engineering context. Not in a pure mathematics context.

I am and will remain an anonymous IP. But will some Wikipedians with accounts join in this effort to fix this problem? Please discuss at the other talk page. 71.184.228.118 (talk) 03:41, 30 July 2016 (UTC)

Incorrect polynomial?

I'm not an expert, but it seems to me that the polynomial corresponding to the circuit shown in Figure 1 is x⁴ + x³ + 1 (not x⁴ + x + 1). Dulciana (talk) 18:20, 7 December 2025 (UTC)