Polynomial evaluation over finite fields: New algorithms and complexity bounds

Applicable Algebra in Engineering, Communications and Computing

Volumn 23, Issue 3-4, 2012, Pages 129-141

  Elia, Michele ^a   Rosenthal, Joachim ^b   Schipani, Davide ^b  

^a POLITECNICO DI TORINO   (Italy)

^b UNIVERSITY OF ZURICH   (Switzerland)

Author keywords

Finite fields; Polynomial evaluation; Reed Solomon codes; Syndrome computation

Indexed keywords

ALGORITHMS AND COMPLEXITY; ASYMPTOTIC COMPLEXITY; FINITE FIELDS; POLYNOMIAL EVALUATION;

ALGORITHMS; REED-SOLOMON CODES;

POLYNOMIALS;

EID: 84870872249     PISSN: 09381279     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00200-011-0160-6     Document Type: Article

References (14)

1. Blahut, R.E.: Theory and Practice of Error Control Codes. Addison-Wesley, Reading (1983)
2. Borodin, A., Munro, I.: The Computational Complexity of Algebraic and Numeric Problems. Elsevier, New York (1975)
3. Costa, E., Fedorenko, S.V., Trifonov, P.V.: On computing the syndrome polynomial in Reed-Solomon decoder. Eur. Trans. Telecommun. 15(4), 337-342 (2004)
4. m). IEEE Trans. Comput. 51(3), 346-351 (2002) (Pubitemid 35426909)
5. Interlando, J.C., Byrne, E., Rosenthal, J.: The gate complexity of syndrome decoding of Hamming codes. In: Proceeding of 10th International Conference on Applications of Computer Algebra, pp. 33-37 (2004)
6. Lidl, R., Niederreiter, H.: Introduction to Finite Fields and their Applications. Cambridge University Press, Cambridge (1986)
7. Knuth, D.E.: The Art of Computer Programming, Seminumerical Algorithms, vol II. Addison-Wesley, Reading (1981)
8. Pan, V.Y.: Methods of computing values of polynomials. Uspekhi Mat. Nauk 21, 103-134 (1966)
9. Paterson, M., Stockmeyer, L.: On the number of nonscalar multiplications necessary to evaluate polynomials. SIAM J. Comput. 2, 60-66 (1973)
10. m). IEEE Trans. Comput. C-27(3), 283-285 (1978)
11. Schipani, D., Elia, M., Rosenthal, J.: On the decoding complexity of cyclic codes up to the BCH bound. In: Proceeding of International Symposium on Information Theory (ISIT), 2011
12. MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North Holland, New York (1977)
13. Wicker, S.B., Bhargava, V.K. (eds.): Reed-Solomon Codes and their Applications. IEEE Press, Piscataway (1994)
14. Winograd, S.: On the number of multiplications required to compute certain functions. Proc. Natl. Acad. Sci. USA 58(5), 1840-1842 (1967)