On the equivalence between Berlekamp's and Euclid's algorithms

Authors:
Jean Louis Dornstetter
Affiliations:
Laboratoire Central de Telecommunications, Cedex, France
Venue:
IEEE Transactions on Information Theory
Year:
1987

Citing 0
Cited 17

On computing determinants of matrices without divisions

ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
Factoring high-degree polynomials by the black box Berlekamp algorithm

ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Subquadratic-time factoring of polynomials over finite fields

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Fast construction of irreducible polynomials over finite fields

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Early termination in Ben-Or/Tiwari sparse interpolation and a hybrid of Zippel's algorithm

ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Fast computation of linear generators for matrix sequences and application to the block Wiedemann algorithm

Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Euclidean Modules and Multisequence Synthesis

AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Algorithms for computing the sparsest shifts of polynomials via the Berlekamp/Massey algorithm

Proceedings of the 2002 international symposium on Symbolic and algebraic computation
A Stamping Technique to Increase the Error Correction Capacity of the (127,k,d) RS Code

IOLTW '00 Proceedings of the 6th IEEE International On-Line Testing Workshop (IOLTW)
Early termination over small fields

ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
ISSAC 2007 poster abstracts

ACM Communications in Computer Algebra
From the Euclidean Algorithm for Solving a Key Equation for Dual Reed---Solomon Codes to the Berlekamp---Massey Algorithm

AAECC-18 '09 Proceedings of the 18th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Modified Euclidean algorithms for decoding Reed-Solomon codes

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Secure linear algebra using linearly recurrent sequences

TCC'07 Proceedings of the 4th conference on Theory of cryptography
Fifteen years after DSC and WLSS2 what parallel computations I do today: invited lecture at PASCO 2010

Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
A unified view on sequence complexity measures as isometries

SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
On the matrix berlekamp-massey algorithm

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	754.85

Visualization

Abstract

It is shown that Berlekamp's iterative algorithm can be derived from a normalized version of Euclid's extended algorithm. Simple proofs of the results given recently by Cheng are also presented.