Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,239,440 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.
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 Berlekamp-Massey Algorithm revisited
Nadia Ben Atti
,
G. Díaz-Toca
,
H. Lombardi
Applicable Algebra in Engineering, Communication…
2006
Corpus ID: 14944277
We propose a slight modification of the Berlekamp-Massey Algorithm for obtaining the minimal polynomial of a given linearly…
Expand
2005
2005
Berlekamp-Massey Algorithm
A. Canteaut
Encyclopedia of Cryptography and Security
2005
Corpus ID: 8418936
A tool holder combination for use with a perforated support panel includes an elongate plate having front and rear surfaces and…
Expand
Highly Cited
2004
Highly Cited
2004
Error and Erasure Decoding of Rank-Codes with a Modified Berlekamp-Massey Algorithm
G. Richter
,
S. Plass
2004
Corpus ID: 2152034
This paper investigates error and erasure decoding methods for codes with maximum rank distance. These codes can be used for…
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
1994
Highly Cited
1994
Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound
S. Sakata
,
H. E. Jensen
,
T. Høholdt
IEEE Transactions on Information Theory
1994
Corpus ID: 11121877
Summary form only given, as follows. Efficient decoding of BCH- and Reed-Solomon codes can be done using the Berlekanp-Massey…
Expand
Highly Cited
1991
Highly Cited
1991
VLSI design of inverse-free Berlekamp-Massey algorithm
I. Reed
,
M. Shih
,
T. Truong
1991
Corpus ID: 62732659
The Berlekamp-Massey iterative algorithm for decoding BCH codes is modified to eliminate the calculation of inverses. This new…
Expand
Highly Cited
1987
Highly Cited
1987
A simple derivation of the Berlekamp- Massey algorithm and some applications
K. Imamura
,
W. Yoshida
IEEE Transactions on Information Theory
1987
Corpus ID: 5504432
Another viewpoint is presented on the derivation of the Berlekamp-Massey algorithm. Our approach differs from previous ones in…
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