On a Class of Irreducible Polynomials Over Fp

Authors

  • Melsik K. Kyuregyan Institute for Informatics and Automation Problems of NAS RA
  • Edita Yu. Harutyunyan Institute for Informatics and Automation Problems of NAS RA
  • Mikayel G. Evoyan Yerevan State University

Abstract

The paper presents some results regarding constructive theory of synthesis of irreducible
polynomials of degree pt over Fp from the given primitive elements in Fp, where p is an odd prime and t is an integer whose prime factors all divide p-1.

Author Biography

Mikayel G. Evoyan, Yerevan State University

Faculty of Informatics and Applied Mathematics, Yerevan State University

References

Albert A.A., Fundamental Concepts of Higher Algebra, University of Chicago Press, Chicago, 1956.

Peterson W.W., Weldon E.I. Error-Correcting Codes, 2nd ed., M.I.T. Press, Cambridge, Mass., 1972.

Varshamov R.R. On a method of constructing irreducible polynomials over finite fields. Dokladi Akademii Nauk of Armenia, vol. 79, No. 1, 1984, pp. 26-28 (in Russian).

Downloads

Published

2021-12-10

How to Cite

Kyuregyan, M. K. ., Harutyunyan, E. Y. ., & Evoyan, M. G. . (2021). On a Class of Irreducible Polynomials Over Fp. Mathematical Problems of Computer Science, 31, 5–15. Retrieved from http://mpcs.sci.am/index.php/mpcs/article/view/387

Issue

Vol. 31 (2008): Mathematical Problems of Computer Science

Section

Articles

License

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.