CONNECTIONS BETWEEN THE ALGORITHMS OF BERLEKAMP AND NIEDERREITER FOR FACTORING POLYNOMIALS OVER F(Q)

Authors
FLEISCHMANN P
Citation
P. Fleischmann, CONNECTIONS BETWEEN THE ALGORITHMS OF BERLEKAMP AND NIEDERREITER FOR FACTORING POLYNOMIALS OVER F(Q), Linear algebra and its applications, 192, 1993, pp. 101-108
Citations number
4
Categorie Soggetti
Mathematics,Mathematics
Journal title
Linear algebra and its applications → ACNP
ISSN journal
00243795
Volume
192
Year of publication
1993
Pages
101 - 108
Database
ISI
SICI code
0024-3795(1993)192:<101:CBTAOB>2.0.ZU;2-X
Abstract
In this paper we determine an explicit isomorphism between the solutio n spaces of Berlekamp's and Niederreiter's algorithm for factoring pol ynomials over finite fields. This can be used for the implementation o f a procedure combining the benefits of both methods.