An Online Calculator of Berlekamp-Massey Algorithm

Berlekamp-Massey algorithm is an algorithm that will find the shortest linear feedback shift register (LFSR) for a given binary output sequence. Here we present a web-based implementation to compute the shortest LFSR and linear span of a given binary sequence. If you have any questions or suggestions, please do not hesitate to contact Bo Zhu.

Please enter the binary sequence (separated by commas):

LFSR:
Linear Span:
Time Used:

Please note the output polynomial is using the form that its degree is always equal to the linear span. For example, x^3 + x + 1 means tap positions are 0th and 1st (not 0th and 2nd).