Probabilistic algorithm for finding roots of linearized polynomials
- 17 November 2007
- journal article
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 46 (1), 17-23
- https://doi.org/10.1007/s10623-007-9125-y
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Algorithms for Exponentiation in Finite FieldsJournal of Symbolic Computation, 2000
- Probabilistic crisscross error correctionIEEE Transactions on Information Theory, 1997
- Studying the locator polynomials of minimum weight codewords of BCH codesIEEE Transactions on Information Theory, 1992
- Maximum-rank array codes and their application to crisscross error correctionIEEE Transactions on Information Theory, 1991
- Matrix multiplication via arithmetic progressionsJournal of Symbolic Computation, 1990
- Probabilistic algorithms in finite fieldsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- Probabilistic Algorithms in Finite FieldsSIAM Journal on Computing, 1980
- Bilinear forms over a finite field, with applications to coding theoryJournal of Combinatorial Theory, Series A, 1978
- Contributions to the theory of finite fieldsTransactions of the American Mathematical Society, 1934
- On a special class of polynomialsTransactions of the American Mathematical Society, 1933