Construction of Sequences of N-polynomials Over Finite Fields of Odd Characteristics

Authors

  • Gevorg M. Hambardzumyan Institute for Informatics and Automation Problems of NAS RA

Abstract

References

Cohen S. D., The explicit construction of irreducible polynomials over finite fields, Designs, Codes and Cryptography 2 pp. 1 69-1 74, 1 992.

Kyuregyan M. K., Recurrent methods for constructing irreducible polynomials over Fq of odd characteristics, Finite Fields and Their Applications 9 pp. 39-58, 2003.

Meyn H., Explicit N-Polynomials of 2-Power Degree over Finite Fields, I., Designs, Codes and Cryptography 6 pp. 107-11 6, 1995.

Downloads

Published

2004-05-26

How to Cite

Hambardzumyan, G. M. (2004). Construction of Sequences of N-polynomials Over Finite Fields of Odd Characteristics. Mathematical Problems of Computer Science, 23, 59–66. Retrieved from http://93.187.165.2/index.php/mpcs/article/view/601

Issue

Vol. 23 (2004): 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.