Skip to search formSkip to main contentSkip to account menu

Berlekamp–Massey algorithm

Known as: Berlekamp-Massey, Berlekamp-Massey algorithm 
The Berlekamp–Massey algorithm is an algorithm that will find the shortest linear feedback shift register (LFSR) for a given binary output sequence… 
Wikipedia (opens in a new tab)

Related topics

Related topics

15 relations
AlgorithmAssignment (computer science)BCH codeBerlekamp–Welch algorithm

Broader (1)

Error detection and correction

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
Algebraic Decoding of Quadratic Residue Codes Using Berlekamp-Massey Algorithm
In this paper, an algebraic decoding method is proposed for the quadratic residue codes that utilize the Berlekamp-Massey… 
2006
2006
The Correction Capability of the Berlekamp–Massey–Sakata Algorithm with Majority Voting
Sakata’s generalization of the Berlekamp–Massey algorithm applies to a broad class of codes defined by an evaluation map on an… 
2004
2004
Implementation of the Berlekamp-Massey algorithm using a DSP
Reed-Solomon (RS) codes are error-correcting codes used in many of today's communication systems. RS encoding and decoding are… 
2002
2002
Generalised Berlekamp-Massey algorithm
The Berlekamp-Massey algorithm is revisited and proven again by using the matrix representation. This approach makes the… 
2001
2001
Gröbner Bases over Galois Rings with an Application to Decoding Alternant Codes
We develop a theory of Grobner bases over Galois rings, following the usual formulation for Grobner bases over finite fields. Our… 
1999
1999
New serial architecture for the Berlekamp-Massey algorithm
We propose a new efficient serial architecture to implement the Berlekamp-Massey (1968, 1969) algorithm, which is frequently used… 
Highly Cited
1999
Highly Cited
1999
On decoding of both errors and erasures of a Reed-Solomon code using an inverse-free Berlekamp-Massey algorithm
In a previous article by Truong et al. (see ibid., vol.46, p.973-76, 1998), it was shown that an inverse-free Berlekamp-Massey… 
1998
1998
A fast parallel implementation of a Berlekamp-Massey algorithm for algebraic-geometric codes
We obtain a parallel Berlekamp-Massey-type algorithm for determining error locating functions for the class of one point… 
1994
1994
Encounters with the Berlekamp-Massey Algorithm
In 1969, J. Massey published a now-famous paper showing, among other things, that an iterative algorithm introduced by Berlekamp… 
Highly Cited
1963
Highly Cited
1963
Comparison and Appraisal of Approximation Formulas for Total Elastic Molecular Scattering Cross Sections
The Massey—Mohr (MM), Schiff (S), and Landau—Lifshitz (LL) approximations for the total elastic cross section (Q) are… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)