Designs, Codes and Cryptography

, Volume 53, Issue 3, pp 149–163

Wieferich pairs and Barker sequences

Article

DOI: 10.1007/s10623-009-9301-3

Cite this article as:
Mossinghoff, M.J. Des. Codes Cryptogr. (2009) 53: 149. doi:10.1007/s10623-009-9301-3

Abstract

We show that if a Barker sequence of length n > 13 exists, then either n = 189 260 468 001 034 441 522 766 781 604, or n > 2 · 1030. This improves the lower bound on the length of a long Barker sequence by a factor of more than 107. We also show that all but fewer than 1600 integers n ≤ 4 · 1026 can be eliminated as the order of a circulant Hadamard matrix. These results are obtained by completing extensive searches for Wieferich prime pairs (q, p), which are defined by the relation \({q^{p-1} \equiv1}\) mod p2, and analyzing their results in combination with a number of arithmetic restrictions on n.

Keywords

Barker sequence Circulant Hadamard matrix Wieferich prime pair 

Mathematics Subject Classifications (2000)

11B85 05B10 11A41 94A55 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, LLC 2009

Authors and Affiliations

  1. 1.Department of MathematicsDavidson CollegeDavidsonUSA

Personalised recommendations