In mathematics, in particular in computational algebra, the Berlekamp–Zassenhaus algorithm is an algorithm for factoring polynomials over the integers, named after Elwyn Berlekamp and Hans Zassenhaus.
algorithm | RSA (algorithm) | Secure Hash Algorithm | Schönhage–Strassen algorithm | Luhn algorithm | Elwyn Berlekamp | Earley's Algorithm | Dijkstra's algorithm | CYK algorithm | Viterbi algorithm | Prim's algorithm | Levenberg–Marquardt algorithm | Kosaraju's algorithm | Yarrow algorithm | sorting algorithm | Root-finding algorithm | Kruskal's algorithm | Hans Zassenhaus | Generic Security Service Algorithm for Secret Key Transaction | Digital Signature Algorithm | Cayley–Purser algorithm | Blahut–Arimoto algorithm | Bellman–Ford algorithm | Algorithm | Verhoeff algorithm | Vatti clipping algorithm | Sorting algorithm | Secure Hash Algorithm (disambiguation) | Schoof's algorithm | Schoof–Elkies–Atkin algorithm |
In the problem of decoding Reed–Solomon codes, the inputs are pair wise distinct evaluation points ’s (i = 1, . . ., n) where with dimension and distance and a codeword = .