Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,326,147 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
15 relations
Algorithm
Assignment (computer science)
BCH code
Berlekamp–Welch algorithm
Expand
Broader (1)
Error detection and correction
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Proposed Enhancement of A5/1 stream cipher
Sattar B. Sadkhan
,
Z. Hamza
2nd International Conference on Engineering…
2019
Corpus ID: 211688862
A5/1 used in GSM to encrypt the conversations. In this paper, proposed an enhancement of A5/1 is add fourth register will be…
Expand
Highly Cited
2007
Highly Cited
2007
Algebraic Decoding of Quadratic Residue Codes Using Berlekamp-Massey Algorithm
Yan-Haw Chen
,
T. Truong
,
Yaotsu Chang
,
Chong-Dao Lee
,
Shi-Huang Chen
Journal of information science and engineering
2007
Corpus ID: 12687847
In this paper, an algebraic decoding method is proposed for the quadratic residue codes that utilize the Berlekamp-Massey…
Expand
2006
2006
The Correction Capability of the Berlekamp–Massey–Sakata Algorithm with Majority Voting
M. Bras-Amorós
,
M. O'Sullivan
Applicable Algebra in Engineering, Communication…
2006
Corpus ID: 29250493
Sakata’s generalization of the Berlekamp–Massey algorithm applies to a broad class of codes defined by an evaluation map on an…
Expand
2004
2004
Implementation of the Berlekamp-Massey algorithm using a DSP
S. Greenberg
,
Nir Feldblum
,
Gal Melamed
Proceedings of the 11th IEEE International…
2004
Corpus ID: 22157771
Reed-Solomon (RS) codes are error-correcting codes used in many of today's communication systems. RS encoding and decoding are…
Expand
2002
2002
Generalised Berlekamp-Massey algorithm
Mu-Huo Cheng
2002
Corpus ID: 19989659
The Berlekamp-Massey algorithm is revisited and proven again by using the matrix representation. This approach makes the…
Expand
1999
1999
New serial architecture for the Berlekamp-Massey algorithm
Hsie-Chia Chang
,
C. Shung
IEEE Transactions on Communications
1999
Corpus ID: 2314752
We propose a new efficient serial architecture to implement the Berlekamp-Massey (1968, 1969) algorithm, which is frequently used…
Expand
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
J. Jeng
,
T. Truong
IEEE Transactions on Communications
1999
Corpus ID: 44509888
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…
Expand
1998
1998
A fast parallel implementation of a Berlekamp-Massey algorithm for algebraic-geometric codes
R. Kotter
1998
Corpus ID: 195705732
We obtain a parallel Berlekamp-Massey-type algorithm for determining error locating functions for the class of one point…
Expand
1994
1994
Encounters with the Berlekamp-Massey Algorithm
T. Kailath
1994
Corpus ID: 115846246
In 1969, J. Massey published a now-famous paper showing, among other things, that an iterative algorithm introduced by Berlekamp…
Expand
Highly Cited
1963
Highly Cited
1963
Comparison and Appraisal of Approximation Formulas for Total Elastic Molecular Scattering Cross Sections
R. Bernstein
,
K. Kramer
1963
Corpus ID: 51748627
The Massey—Mohr (MM), Schiff (S), and Landau—Lifshitz (LL) approximations for the total elastic cross section (Q) are…
Expand
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)
ACCEPT & CONTINUE