The Berlekamp–Massey algorithm is an algorithm that will find the shortest linear-feedback shift register (LFSR) for a given binary output sequence. The...
9 KB (1,222 words) - 06:47, 3 May 2025
polynomials and the Berlekamp switching game, and was one of the inventors of the Berlekamp–Welch algorithm and the Berlekamp–Massey algorithms, which are used...
14 KB (1,318 words) - 12:14, 20 May 2025
Reed–Solomon error correction (redirect from Reed-Solomon error correction algorithm)
decoder was developed by Elwyn Berlekamp and James Massey and has since been known as the Berlekamp–Massey decoding algorithm. In 1975, another improved BCH...
75 KB (12,395 words) - 16:42, 29 April 2025
The Reeds–Sloane algorithm, named after James Reeds and Neil Sloane, is an extension of the Berlekamp–Massey algorithm, an algorithm for finding the shortest...
934 bytes (88 words) - 20:17, 21 November 2021
application of the Berlekamp–Massey algorithm to linear codes, the design of the block ciphers IDEA (with Xuejia Lai, based on the Lai-Massey scheme) and SAFER...
4 KB (316 words) - 10:15, 4 January 2025
{\displaystyle S} and hence S y {\displaystyle S_{y}} . But the Berlekamp–Massey algorithm allows us to calculate relatively efficiently some sequence q...
6 KB (1,084 words) - 19:37, 13 August 2023
Linear-feedback shift register (category Cryptographic algorithms)
minimal size that simulates the intended receiver by using the Berlekamp-Massey algorithm. This LFSR can then be fed the intercepted stretch of output stream...
38 KB (4,725 words) - 04:07, 6 June 2025
hierarchy BCH Codes Berlekamp–Massey algorithm Peterson–Gorenstein–Zierler algorithm Reed–Solomon error correction BCJR algorithm: decoding of error correcting...
72 KB (7,951 words) - 17:13, 5 June 2025
Euclidean algorithm also has other applications in error-correcting codes; for example, it can be used as an alternative to the Berlekamp–Massey algorithm for...
126 KB (15,349 words) - 16:35, 30 April 2025
the Viterbi algorithm, making decoding of convolutional codes practicable 1968 – Elwyn Berlekamp invents the Berlekamp–Massey algorithm; its application...
9 KB (893 words) - 17:34, 2 March 2025
BCH code (redirect from Peterson–Gorenstein–Zierler algorithm)
popular algorithms for this task are: Peterson–Gorenstein–Zierler algorithm Berlekamp–Massey algorithm Sugiyama Euclidean algorithm Peterson's algorithm is...
50 KB (10,768 words) - 03:46, 1 June 2025
Adler-32 Algebraic geometry code BCH code BCJR algorithm Belief propagation Berger code Berlekamp–Massey algorithm Binary Golay code Binary Goppa code Bipolar...
3 KB (9 words) - 23:09, 3 June 2023
Elwyn Berlekamp invents the Berlekamp–Massey algorithm; its application to decoding BCH and Reed–Solomon codes is pointed out by James L. Massey the following...
14 KB (1,725 words) - 14:51, 25 May 2025
ciphers • Beaufort cipher • Beaumanor Hall • Bent function • Berlekamp–Massey algorithm • Bernstein v. United States • BestCrypt • Biclique attack • BID/60...
67 KB (2,932 words) - 23:20, 16 May 2025
Feedback with Carry Shift Registers (category Cryptographic algorithms)
a variant of the Euclidean algorithm when N is prime; and in general by Xu's adaptation of the Berlekamp-Massey algorithm. If L is the size of the smallest...
8 KB (1,077 words) - 02:18, 5 July 2023
in network coding. Linear code Reed–Solomon error correction Berlekamp–Massey algorithm Network coding Codes for which each input symbol is from a set...
7 KB (1,205 words) - 19:03, 12 August 2023
Machine, Claude Shannon, 1949 Berlekamp, Elwyn; Solomon W. Golomb; Thomas M. Cover; Robert G. Gallager; James L. Massey; Andrew J. Viterbi (January 2002)...
53 KB (6,893 words) - 16:19, 30 May 2025