Strongly regular Cayley graphs, skew Hadamard difference sets, and rationality of relative Gauss sums

Authors:
Koji Momihara
Affiliations:
-
Venue:
European Journal of Combinatorics
Year:
2013

Citing 9
Cited 0

A survey of partial difference sets

Designs, Codes and Cryptography
Some New Cyclotomic Strongly Regular Graphs

Journal of Algebraic Combinatorics: An International Journal
Finite fields

Finite fields
Cyclotomy and Strongly Regular Graphs

Journal of Algebraic Combinatorics: An International Journal
Pseudocyclic association schemes and strongly regular graphs

European Journal of Combinatorics
Cyclotomic constructions of skew Hadamard difference sets

Journal of Combinatorial Theory Series A
Strongly regular graphs from unions of cyclotomic classes

Journal of Combinatorial Theory Series B
Quadratic Gauss Sums

Finite Fields and Their Applications
All Two-Weight Irreducible Cyclic Codes?

Finite Fields and Their Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we give constructions of strongly regular Cayley graphs and skew Hadamard difference sets. Both constructions are based on choosing cyclotomic classes in finite fields. Our results generalize ten of the eleven sporadic examples of cyclotomic strongly regular graphs given by Schmidt and White (2002) [23] and several subfield examples into infinite families. These infinite families of strongly regular graphs have new parameters. The main tools that we employed are relative Gauss sums instead of explicit evaluations of Gauss sums.