This example shows how my implementation of the Berlekamp-Massey algorithm works. By shifting the current LFSR upward, while keeping the previous LFSR fixed, the multiplication of p(x) by x^l is accomplished without extra effort. At the same time, the current LFSR lines up perfectly with the next syndromes it would need to be multiplied with in order to compute discrepancy.