The transition algorithm
discards all but
r>0 values
from each block of
p ≥ r values delivered by
e. The state transition is performed as follows:
If
n ≥ r,
advance the state of
e from
ei to
ei+p−r
and set
n to
0. In any case,
then increment
n
and advance
e's then-current state
ej
to
ej+1.