John F. Dillon

According to our database, John F. Dillon authored at least 8 papers between 1985 and 2015.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2015

Character Sum Factorizations Yield Sequences With Ideal Two-Level Autocorrelation.

K. T. Arasu, John F. Dillon, Kevin J. Player

IEEE Trans. Inf. Theory, 2015

2011

On the dimension of an APN code.

John F. Dillon

Cryptogr. Commun., 2011

2007

Abelian difference sets of order <i>n</i> dividing lambda.

K. T. Arasu, Yu Qing Chen, John F. Dillon, Xiaoyu Liu, Kevin J. Player

Des. Codes Cryptogr., 2007

2002

The epidemiology of liver disease in Tayside database: a population-based record-linkage study.

Douglas T. Steinke, Tanya L. Weston, Andrew D. Morris, Thomas M. MacDonald, John F. Dillon

J. Biomed. Informatics, 2002

2001

Cyclic Relative Difference Sets with Classical Parameters.

K. T. Arasu, John F. Dillon, Ka Hin Leung, Siu Lun Ma

J. Comb. Theory, Ser. A, 2001

1999

Multiplicative Difference Sets via Additive Characters.

John F. Dillon

Des. Codes Cryptogr., 1999

1995

The Solution of the Waterloo Problem.

K. T. Arasu, John F. Dillon, Dieter Jungnickel, Alexander Pott

J. Comb. Theory, Ser. A, 1995

1985

Variations on a Scheme of McFarland for Noncyclic Difference Sets.

John F. Dillon

J. Comb. Theory, Ser. A, 1985