2003/04/30 by Leonard D. Baumert, L. D. Baumert, Baumert, Leonard D. +2
Computer Science · Engineering · Mathematics · #05B10 #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory #graph theory and CDMA systems #math.CO #msc:05B10
paper · pdf · doi:10.48550/arxiv.math/0304502
8 pages. To appear, Proceedings of Fields Institute conference in number theory in honor of Hugh Williams
arxiv created 2003/04/30 · openalex publication_date 2003/04/30 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Previous surveys by Baumert and Lopez and Sanchez have resolved the existence of cyclic (v,k,lambda) difference sets with k <= 150, except for six open cases. In this paper we show that four of those difference sets do not exist. We also look at the existence of difference sets with k <= 300 and cyclic Hadamard difference sets with v <= 10,000. Finally, we extend an earlier search of the second author to show that no cyclic projective planes exist with non-prime power orders up to two billion.