A recursive construction for skew Hadamard difference sets
From MaRDI portal
Publication:2194087
DOI10.37236/9058zbMath1446.05011OpenAlexW3083415819MaRDI QIDQ2194087
Publication date: 25 August 2020
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.37236/9058
Association schemes, strongly regular graphs (05E30) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Cyclotomy (11T22)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Inequivalence of skew Hadamard difference sets and triple intersection numbers modulo a prime
- Cyclotomic constructions of skew Hadamard difference sets
- A family of skew Hadamard difference sets
- An exponent bound on skew Hadamard abelian difference sets
- Abelian and non-abelian Paley type group schemes
- Paley type sets from cyclotomic classes and Aarasu-Dillon-Player difference sets
- Skew Hadamard difference sets from the Ree-Tits slice symplectic spreads in PG\((3,3^{2h+1})\)
- Skew Hadamard Difference Sets from Cyclotomic Strongly Regular Graphs
- A Theorem on Permutations in a Finite Field
- Skew Hadamard Difference Sets from Dickson Polynomials of Order 7
- 2-Transitive Symmetric Designs
This page was built for publication: A recursive construction for skew Hadamard difference sets