September 30, 2009

Associate Professor Michael Mossinghoff authored a paper just published in the journal Designs, Codes and Cryptography.  The abstract for his paper titled Wieferich pairs and Barker sequences begins  "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 · 10³⁰."  Now those are big numbers!