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 = .
algorithm | RSA (algorithm) | Royal Welch Fusiliers | Jack Welch | Secure Hash Algorithm | Stanton Welch | Raquel Welch | Schönhage–Strassen algorithm | Peter Welch | Luhn algorithm | Lenny Welch | Kevin Welch | Elwyn Berlekamp | Earley's Algorithm | Dijkstra's algorithm | CYK algorithm | William H. Welch | Viterbi algorithm | Prim's algorithm | Levenberg–Marquardt algorithm | Kosaraju's algorithm | Yarrow algorithm | Welch Regiment | Welch | sorting algorithm | Sean Welch | Root-finding algorithm | Louie Welch | Kruskal's algorithm | John Welch Jones |
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.
Leonard Esau Baum was an American mathematician, known for the Baum–Welch algorithm.