A geometric approach to root finding in GT(q/sup m/)
- 1 March 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 35 (2) , 444-453
- https://doi.org/10.1109/18.32139
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- On splitting sets in block designs and finding roots of polynomialsDiscrete Mathematics, 1990
- Optimal normal bases in GF(pn)Discrete Applied Mathematics, 1989
- Low complexity normal basesDiscrete Applied Mathematics, 1989
- Probabilistic algorithms in finite fieldsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- A new algorithm for factoring polynomials over finite fieldsMathematics of Computation, 1981
- Probabilistic Algorithms in Finite FieldsSIAM Journal on Computing, 1980
- A conversion algorithm for logarithms on GF(2n)Journal of Pure and Applied Algebra, 1974
- Factoring Polynomials Over Large Finite FieldsMathematics of Computation, 1970
- On the solution of algebraic equations over finite fieldsInformation and Control, 1967
- Combinatorial MathematicsPublished by American Mathematical Society (AMS) ,1963