2014/09/24 by Tim Trudgian, Qiang Wang, Trudgian, Tim +1
Computer Science · Engineering · #11A07 #11T06 #Cellular Automata and Applications #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Number Theory (math.NT) #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1409.6827
openalex publication_date 2014/09/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We examine two particular constructions of Costas arrays known as the Taylor variant of the Lempel construction, or the T4 construction, and the variant of the Golomb construction, or the G4 construction. We connect these constructions with the concept of Fibonacci primitive roots, and show that under the Extended Riemann Hypothesis the T4 and G4 constructions are valid infinitely often.