Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,505,023 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
2017
2017
Assignee : Bell Telephone laboratories , Incorporated , Primary
E. E. Atkinson
,
M. Hill
,
Kenneth B. Hamlin
2017
Corpus ID: 53006425
(73) Assignee: Bell Telephone laboratories, Incorporated, Primary Examiner-Charles E. Atkinson Murray Hill, N.J. Attorney-R.J…
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
2000
2000
The implementation of generalized minimum distance decoding for Reed Solomon codes
A. Mahmudi
,
M. Benaissa
,
P. Sweeney
IEEE International Symposium on Circuits and…
2000
Corpus ID: 36727609
Generalized minimum distance (GMD) decoding is a variant of soft-decision decoding for RS codes. It is well known that soft…
Expand
1997
1997
An advanced VLSI architecture of RS decoders for advanced TV
Yonghee Im
,
Oh-Sang Kwon
International Conference on Communications
1997
Corpus ID: 43317058
The Reed-Solomon (RS) decoders which are designed for advanced TV (ATV) are reported. The architecture has three features. First…
Expand
1996
1996
A parametrical architecture for Reed-Solomon decoders
M. Petre
,
G. Masera
Proceedings of the Sixth Great Lakes Symposium on…
1996
Corpus ID: 40856326
Reed-Solomon decoders are digital decoders that use RS detecting and correcting of errors codes. RS codes are widely diffused in…
Expand
1981
1981
On polynomial factorization over finite fields
Hiroshi Gunji
,
Dennis Arnon
1981
Corpus ID: 1983490
Let f(x) be a polynomial over a finite field F. An algorithm for determining the degrees of the factors of f(x) is presented. As…
Expand
1977
1977
Decoding of alternant codes (Corresp.)
H. Helgert
IEEE Transactions on Information Theory
1977
Corpus ID: 43615848
It is shown that the only modification of the Berlekamp algorithm required to decode the class of alternant codes consists of a…
Expand
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.