BM Algorithm for Binary LFSR Synthesis

bm2() is a direct implementation of the original BM algorithm for binary LFSR synthesis.

bm2() is a direct implementation of the original Berlekamp-Massey algorithm for binary LFSR synthesis.
c = bm2(s) gives the LFSR feedback polynomial coefficients c for generating the binary sequence s. The vectors c and s are row vectors. For correct operation, the length of s should be greater than or equal to 2L, where L is the number of delay elements in the original LFSR.
Refer to bm2_test.m script provided together for a sample usage of bm2().

References:
[1] James L. Massey, "Shift-register synthesis and BCH decoding", IEEE Trans. Inform. Theory, vol. 15, no. 1, pp. 122-127, Jan.1969