Palindromic Polynomials over Finite Fields
Geoffrey Price, and Katherine Thompson

TL;DR
This paper counts monic polynomials with specific palindromic factors over finite fields and applies the results to systems of linear equations of index 2, advancing understanding of polynomial structures in finite fields.
Contribution
It introduces a method to count polynomials with self-reciprocal factors over finite fields and applies this to analyze certain linear systems.
Findings
Derived formulas for counting polynomials with palindromic factors
Established connections between polynomial factorization and linear systems
Provided applications to systems of linear equations of index 2
Abstract
For any finite field and any positive integer we count the number of monic polynomials of degree over with nonzero constant coefficient and a self-reciprocal factor of any specified degree. An application is given for systems of linear equations over of index .
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 · Polynomial and algebraic computation · Algebraic Geometry and Number Theory
