Skip to main content
×
Home
    • Aa
    • Aa

Wieferich pairs and Barker sequences, II

  • Peter Borwein (a1) and Michael J. Mossinghoff (a2)
Abstract
Abstract

We show that if a Barker sequence of length $n>13$ exists, then either n $=$ 3 979 201 339 721 749 133 016 171 583 224 100, or $n > 4\cdot 10^{33}$ . This improves the lower bound on the length of a long Barker sequence by a factor of nearly $2000$ . We also obtain eighteen additional integers $n<10^{50}$ that cannot be ruled out as the length of a Barker sequence, and find more than 237 000 additional candidates $n<10^{100}$ . These results are obtained by completing extensive searches for Wieferich prime pairs and using them, together with a number of arithmetic restrictions on $n$ , to construct qualifying integers below a given bound. We also report on some updated computations regarding open cases of the circulant Hadamard matrix problem.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      Wieferich pairs and Barker sequences, II
      Available formats
      ×
      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about sending content to Dropbox.

      Wieferich pairs and Barker sequences, II
      Available formats
      ×
      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about sending content to Google Drive.

      Wieferich pairs and Barker sequences, II
      Available formats
      ×
Copyright
References
Hide All
1. Eliahou S. and Kervaire M., ‘Barker sequences and difference sets’, Enseign. Math. (2) 38 (1992) no. 3–4, 345382; Corrigendum, Enseign. Math. (2) 40 (1994) no. 1–2, 109–111; MR 1189012 (93i:11018).
2. Eliahou S., Kervaire M. and Saffari B., ‘A new restriction on the lengths of Golay complementary sequences’, J. Combin. Theory Ser. A 55 (1990) no. 1, 4959; MR 1070014 (91i:11020).
3. Jedwab J. and Lloyd S., ‘A note on the nonexistence of Barker sequences’, Des. Codes Cryptogr. 2 (1992) no. 1, 9397; MR 1157481 (93e:11032).
4. Leung K. H. and Schmidt B., ‘The field descent method’, Des. Codes Cryptogr. 36 (2005) no. 2, 171188; MR 2211106 (2007g:05023).
5. Leung K. H. and Schmidt B., ‘New restrictions on possible orders of circulant Hadamard matrices’, Des. Codes Cryptogr. 64 (2012) no. 1–2, 143151; MR 2914407.
6. Mossinghoff M. J., ‘Wieferich pairs and Barker sequences’, Des. Codes Cryptogr. 53 (2009) no. 3, 149163; MR 2545689 (2011c:11039).
7. Mossinghoff M. J., ‘Wieferich prime pairs, Barker sequences, and circulant Hadamard matrices’, 2013, http://www.cecm.sfu.ca/∼mjm/WieferichBarker.
8. Schmidt B., ‘Cyclotomic integers and finite geometry’, J. Amer. Math. Soc. 12 (1999) no. 4, 929952; MR 1671453 (2000a:05042).
9. Tarjan R., ‘Enumeration of the elementary circuits of a directed graph’, SIAM J. Comput. 2 (1973) 211216; MR 0325448 (48 #3795).
10. Turyn R., ‘Character sums and difference sets’, Pacific J. Math. 15 (1965) 319346; MR 0179098 (31 #3349).
11. Turyn R. and Storer J., ‘On binary sequences’, Proc. Amer. Math. Soc. 12 (1961) 394399; MR 0125026 (23 #A2333).
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

LMS Journal of Computation and Mathematics
  • ISSN: -
  • EISSN: 1461-1570
  • URL: /core/journals/lms-journal-of-computation-and-mathematics
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×
MathJax

Keywords:

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 51 *
Loading metrics...

Abstract views

Total abstract views: 126 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 22nd October 2017. This data will be updated every 24 hours.