Probabilistic algorithm for finding roots of linearized polynomials

Designs, Codes, and Cryptography

Volumn 46, Issue 1, 2008, Pages 17-23

  Skachek, Vitaly ^a   Roth, Ron M ^b  

^a UNIVERSITY COLLEGE DUBLIN   (Ireland)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Linearized polynomials; Probabilistic algorithms; Root finding algorithms; Symbolic GCD

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; LINEARIZATION; PROBABILISTIC LOGICS;

LINEARIZED POLYNOMIALS; PROBABILISTIC ALGORITHM; ROOT-FINDING ALGORITHMS; SYMBOLIC GCD;

POLYNOMIALS;

EID: 37149008079     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10623-007-9125-y     Document Type: Article

References (16)

1. Aho A.V., Hopcroft J.E. and Ullman J.D. (1974). The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA
2. Augot D., Charpin P. and Sendrier N. (1992). Studying the locator polynomials of minimum weight codewords of BCH codes. IEEE Trans. Inform. Theory 38: 960-973
3. Ben-Or, M.: Probabilistic algorithms in finite fields. In: Proceedings of 22nd Annual IEEE Symposium Foundations of Computer Science (FOCS'1981). Nashville, TN pp. 394-398 (1981).
4. Coppersmith D. and Winograd S. (1990). Matrix multiplication via arithmetic progressions. J. Symb. Comput. 9: 251-280
5. Delsarte P. (1978). Bilinear forms over a finite field, with applications to coding theory. J. Comb. Theory A 25: 226-241
6. Gabidulin E.M. (1985). Theory of codes with maximum rank distance. Probl. Inform. Transm. 21: 1-12
7. Gao S., von zur Gathen J., Panario D. and Shoup V. (2000). Algorithms for exponentiation in finite fields. J. Symb. Comput. 29: 879-889
8. von zur Gathen J. and Gerhard J. (1999). Modern Computer Algebra. Cambridge University Press, Cambridge, UK
9. Lidl R. and Niederreiter H. (1997). Finite Fields, 2nd ed. Cambridge University Press, Cambridge, UK
10. Loidreau, P.: A Welch-Berlekamp like algorithm for decoding Gabidulin codes. In: Proceedings of the 4th International Workshop on Coding and Cryptography (WCC'2005). Bergen, Norway pp. 36-45 (2005).
11. MacWilliams F.J. and Sloane N.J.A. (1977). The Theory of Error-Correcting Codes. North-Holland, Amsterdam, The Netherlands
12. Ore O. (1933). On a special class of polynomials. Trans. Amer. Math. Soc. 35: 559-584
13. Ore O. (1934). Contributions to the theory of finite fields. Trans. Amer. Math. Soc. 36: 243-274
14. Rabin M.O. (1980). Probabilistic algorithms in finite fields. SIAM J. Comput. 9: 273-280
15. Roth R.M. (1991). Maximum-rank array codes and their application to crisscross error correction. IEEE Trans. Inform. Theory 37: 328-336
16. Roth R.M. (1997). Probabilistic crisscross error correction. IEEE Trans. Inform. Theory 43: 1425-1436