Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,539,895 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.
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
Highly Cited
2007
Highly Cited
2007
New List Decoding Algorithms for Reed–Solomon and BCH Codes
Yingquan Wu
IEEE Transactions on Information Theory
2007
Corpus ID: 2275575
In this paper, we devise a rational curve fitting algorithm and apply it to the list decoding of Reed-Solomon and Bose-Chaudhuri…
Expand
2005
2005
A simple algorithm for decoding Reed-Solomon codes and its relation to the Welch-Berlekamp algorithm
Sergei V. Fedorenko
IEEE Transactions on Information Theory
2005
Corpus ID: 2086
A simple and natural Gao algorithm for decoding algebraic codes is described. Its relation to the Welch-Berlekamp and Euclidean…
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
1989
1989
On Computing the Canonical Form for a Binary Form of Odd Degree
A. Dür
Journal of symbolic computation
1989
Corpus ID: 39105378
1987
1987
Deterministic Irreducibility Testing of Polynomials over Large Finite Fields
E. Kaltofen
Journal of symbolic computation
1987
Corpus ID: 22416468
1987
1987
Application of signature analysis to the concurrent test of microprogrammed control units
Jordi Duran
,
T. Mangir
1987
Corpus ID: 62129825
1984
1984
On the continued fraction and Berlekamp's algorithm
U. Cheng
IEEE Transactions on Information Theory
1984
Corpus ID: 206735411
Continued fraction techniques are equivalent to Berlekamp's algorithm. The sequence D(k), k \geq 0 , in Berlekamp's algorithm…
Expand
Highly Cited
1979
Highly Cited
1979
Continued fractions and Berlekamp's algorithm
L. Welch
,
R. Scholtz
IEEE Transactions on Information Theory
1979
Corpus ID: 10066690
Theorems are presented concerning the optimality of rational approximations using non-Archimedean norms. The algorithm for…
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