While the LFSR discards (or outputs) the rightmost entry $b_0$ (and replaces it by $b_1$), it computes the linear function The classical reference on shift register sequences is see also or for expositions.Ī linear feedback shift register of length $n$ (LFSR) is a time-dependent device (running on a clock) of $n$ cells each capable of holding a value from some field $F$, such that with each clock cycle the contents of the cells are shifted cyclically by one position (to the right, say). The term 'shift register sequence' stems from the engineering literature in mathematics, the terms recursive sequence or recurrent sequence are more common.

A sequence which can be obtained as the output of a linear feedback shift register.