Irreducible Compositions of Polynomials over Finite Fields
Melsik K. Kyuregyan, Gohar M. Kyureghyan
TL;DR
This paper explores methods for constructing irreducible polynomials over finite fields through polynomial composition, aiming to expand the toolkit for finite field applications.
Contribution
It introduces new techniques for generating irreducible polynomials via polynomial composition over finite fields.
Findings
New composition-based methods for irreducible polynomial construction
Conditions under which polynomial compositions remain irreducible
Potential applications in coding theory and cryptography
Abstract
The paper studies constructions of irreducible polynomials over finite fields using polynomial composition method.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · Finite Group Theory Research