Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,184,859 papers from all fields of science
Search
Sign In
Create Free Account
Berlekamp's algorithm
Known as:
Berlekamp algorithm
, Berlekamp's Q matrix
In mathematics, particularly computational algebra, Berlekamp's algorithm is a well-known method for factoring polynomials over finite fields (also…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
10 relations
Berlekamp–Zassenhaus algorithm
Cantor–Zassenhaus algorithm
Computer algebra system
Discrete logarithm
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Modified Welch Berlekamp Algorithm to Decode Reed Solomon Codes
A. Mahmudi
,
S. Achmadi
,
Michael
2018
Corpus ID: 55934245
. In this paper, the Reed Solomon Code is decoded using the Welch-Berlekamp Algorithm. The RS Decoder is implemented using…
Expand
2009
2009
Improving the Berlekamp algorithm for binomials xn-a
Ryuichi Harasawa
,
Yutaka Sueyoshi
,
Aichi Kudo
,
Liang Cui
IACR Cryptology ePrint Archive
2009
Corpus ID: 265096896
In this paper, we describe an improvement of the Berlekamp algorithm for binomials xn−a over prime fields Fp. We implement the…
Expand
2009
2009
The Berlekamp algorithm
J. Kerl
2009
Corpus ID: 121995464
Integer factorization is a Hard Problem. Some cryptosystems, such as RSA, are in fact designed around the difficulty of integer…
Expand
2008
2008
A decoding method for binary quadratic residue codes
Chong-Dao Lee
,
Yan-Haw Chen
Asia-Pacific Conference on Communications
2008
Corpus ID: 44621192
In this paper, a decoding method to use Euclidean algorithm for binary quadratic residue codes is proposed. A computer simulation…
Expand
2000
2000
A system-theoretic derivation of the Welch-Berlekamp algorithm
M. Kuijper
IEEE International Symposium on Information…
2000
Corpus ID: 122541181
The similarity of the Berlekamp-Massey (B-M) algorithm and the Welch-Berlekamp (W-B) algorithm is demonstrated in showing that…
Expand
1995
1995
The Welch-Berlekamp and Berlekamp-Massey algorithms
S. Blackburn
Proceedings of IEEE International Symposium on…
1995
Corpus ID: 118089303
Classically, the decoding of a Reed-Solomon code is carried out by calculating power sum syndromes and then using the Berlekamp…
Expand
1987
1987
Application of signature analysis to the concurrent test of microprogrammed control units
Jordi Duran
,
T. Mangir
1987
Corpus ID: 62129825
1976
1976
A New Approach to the Symbolic Factorization of Multivariate Polynomials
Billy G. Claybrook
Artificial Intelligence
1976
Corpus ID: 47307295
1975
1975
Decoding Goppa codes with a BCH decoder (Corresp.)
C. Retter
IEEE Transactions on Information Theory
1975
Corpus ID: 32144329
It is shown that Goppa codes can be decoded by a simple modification of a decoder for a Reed-Solomon code.
1972
1972
Some Results in Decoding of Certain Maximal-distance and BCH Codes
D. Mandelbaum
Information and Control
1972
Corpus ID: 3257382
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