Irreducible polynomials from a cubic transformation
Sandro Mattarei, Marco Pizzato

TL;DR
This paper investigates the count of irreducible polynomials over finite fields formed via a cubic rational transformation, providing insights into their structure and applications in transformation shift registers.
Contribution
It introduces a method to count irreducible polynomials of a specific form involving cubic transformations, extending previous results on shift register irreducibility.
Findings
Derived a formula for counting irreducible polynomials with cubic transformations
Connected polynomial counts to irreducible transformation shift registers
Reproduced known results for shift register irreducibility
Abstract
Let be a rational expression of degree three over the finite field . We count the irreducible polynomials in , of a given degree, which have the form for some . As an application, we recover the number of irreducible transformation shift registers of order three, previously computed by Jiang and Yang.
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 · Cellular Automata and Applications · graph theory and CDMA systems
