Concepts2
∑MathAdvanced
Berlekamp-Massey Algorithm
Berlekamp–Massey (BM) finds the shortest linear recurrence that exactly fits a given sequence over a field (e.g., modulo a prime).
#berlekamp-massey#linear recurrence#minimal polynomial+11
∑MathAdvanced
Gaussian Elimination over GF(2)
Gaussian elimination over GF(2) is ordinary Gaussian elimination where addition and subtraction are XOR and multiplication is AND.
#gaussian elimination#gf(2)#xor basis+12