The $T_{4}$ and $G_{4}$ constructions of Costas arrays
Tim Trudgian, Qiang Wang

TL;DR
This paper investigates two specific methods for constructing Costas arrays, linking them to Fibonacci primitive roots, and demonstrates their infinite validity under the Extended Riemann Hypothesis.
Contribution
It establishes the connection between the $T_{4}$ and $G_{4}$ constructions and Fibonacci primitive roots, proving their infinite occurrence under a major hypothesis.
Findings
The $T_{4}$ and $G_{4}$ constructions are valid infinitely often under the Extended Riemann Hypothesis.
Connection established between Costas array constructions and Fibonacci primitive roots.
Provides a theoretical foundation for the infinite existence of these constructions.
Abstract
We examine two particular constructions of Costas arrays known as the Taylor variant of the Lempel construction, or the construction, and the variant of the Golomb construction, or the construction. We connect these constructions with the concept of Fibonacci primitive roots, and show that under the Extended Riemann Hypothesis the and constructions are valid infinitely often.
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
Topicsgraph theory and CDMA systems · Cellular Automata and Applications · Coding theory and cryptography
