Determining Sidon polynomials on Sidon sets over finite fields
Let $p$ be a prime, and $q=p^n$ be a prime power. In his works on Sidon sets over $\mathbb{F}_q \times \mathbb{F}_q$, Cilleruelo conjectured about polynomials that could generate $q$-element Sidon sets over $\mathbb{F}_q\times \mathbb{F}_q$. Here, we derive some criteria for determining polynomials that could generate $q$-element Sidon set over $\mathbb{F}_q\times \mathbb{F}_q$. Using these criteria, we prove that certain classes of monomials and cubic polynomials over $\mathbb{F}_p$ cannot be used to generate $p$-element Sidon set over $\mathbb{F}_p\times \mathbb{F}_p$. We also discover a connection between the needed polynomials and planar polynomials.
Authors
- Aleams Barra (ORCID: https://orcid.org/0000-0001-8618-4821)
- Muhammad Afifurrahman (ORCID: https://orcid.org/0000-0002-7400-320X)
Institutions
- Bandung Institute of Technology (ID)
Publication Details
- Journal
- Journal of Algebra Combinatorics Discrete Structures and Applications
- Published
- 2024-09-01
- DOI
- https://doi.org/10.13069/jacodesmath.v11i3.281
- Primary Topic
- Coding theory and cryptography
- Type
- article
- Field-Weighted Citation Impact
- 0.00