The breakthrough in 70 years by Cunsheng Ding and Jin Yuan

• Announcement of the breakthrough to the community on 30 August 2004

• Paper published in J. Combinatorial Theory A 113 (2006) 1526--1535 

• The slides for the keynote talk on this at two international conferences

• Award from Elsevier: Top Cited Article 2005--2010

Progress made by the community after the breakthrough

(A) More skew Hadamard difference sets after the Breakthrough

• Skew Hadamard difference sets from the Ree-Tits slice symplectic spreads in PG(3,3^{2h+1}), J. Combinatorial Theory A 114(5) (2007) 867--887.

• Pseudo-Paley graphs and skew Hadamard difference sets from presemifields, Designs, Codes and Cryptography 44 (2007) 49-62.

• Non-abelian skew Hadamard difference sets fixed by a prescribed automorphism, J. Combinatorial Theory A 118(1) (2011) 27--36.

• On skew Hadamard difference sets, preprint

• Cyclotomic constructions of skew Hadamard difference sets, J. Combinatorial Theory A 119 (2012) 245--256.
• Skew Hadamard difference sets from cyclotomic strongly regular graphs  SIAM J. Discrete Math. 27 (2013) 1112--1122.
• Skew Hadamard difference sets from Dickson polynomials of order 7,  J. Combinatorial Designs 23 (2015) 417--461.

(B) Applications in coding theory, cryptography, CDMA communications, and finite geometry

• A list of references on the applications of skew Hadamard difference sets

Back to the previous page