A recursive construction for skew Hadamard difference sets
DOI10.37236/9058zbMATH Open1446.05011OpenAlexW3083415819MaRDI QIDQ2194087FDOQ2194087
Authors: Koji Momihara 
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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Association schemes, strongly regular graphs (05E30) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Cyclotomy (11T22)
Cites Work
- Title not available (Why is that?)
- A family of skew Hadamard difference sets
- Fibonacci and Lucas numbers with applications. Volume I
- Cyclotomic constructions of skew Hadamard difference sets
- Skew Hadamard difference sets from cyclotomic strongly regular graphs
- Skew Hadamard difference sets from the Ree-Tits slice symplectic spreads in PG\((3,3^{2h+1})\)
- Skew Hadamard difference sets from Dickson polynomials of order 7
- Inequivalence of skew Hadamard difference sets and triple intersection numbers modulo a prime
- A Theorem on Permutations in a Finite Field
- An exponent bound on skew Hadamard abelian difference sets
- 2-Transitive Symmetric Designs
- Abelian and non-abelian Paley type group schemes
- Paley type sets from cyclotomic classes and Aarasu-Dillon-Player difference sets
Cited In (4)
This page was built for publication: A recursive construction for skew Hadamard difference sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2194087)
