Available in electronic format
Available in print format
Proceedings of the American Mathematical Society
Proceedings of the American Mathematical Society
ISSN 1088-6826 (e) ISSN 0002-9939 (p)
     

Proof of the Barker array conjecture

Author(s): James A. Davis; Jonathan Jedwab; Ken W. Smith
Journal: Proc. Amer. Math. Soc. 135 (2007), 2011-2018.
MSC (2000): Primary 05B10; Secondary 94A99
Posted: March 2, 2007
Retrieve article in: PDF

Abstract | References | Similar articles | Additional information

Abstract: Using only elementary methods, we prove Alquaddoomi and Scholtz's conjecture of 1989, that no $ s \times t$ Barker array having $ s, t > 1$ exists except when $ s = t = 2$.


References:

1.
S. Alquaddoomi and R.A. Scholtz, On the nonexistence of Barker arrays and related matters, IEEE Trans. Information Theory 35 (1989), 1048-1057.MR 1023242 (90h:05035)

2.
R.H. Barker, Group synchronizing of binary digital systems, Communication Theory (W. Jackson, ed.), Academic Press, New York, 1953, pp. 273-287.

3.
T. Beth, D. Jungnickel, and H. Lenz, Design theory, 2nd ed., Cambridge University Press, Cambridge, 1999, Volumes I and II. MR 1729456 (2000h:05019); MR 1742365 (2000j:05002)

4.
Y.K. Chan, M.K. Siu, and P. Tong, Two-dimensional binary arrays with good autocorrelation, Information and Control 42 (1979), 125-130. MR 0542326 (80j:94029)

5.
J. Jedwab, Nonexistence results for Barker arrays, The Institute of Mathematics and its Applications Conference Series (New Series) No. 33: Cryptography and Coding II (C. Mitchell, ed.), Clarendon Press, Oxford, 1992, pp. 121-126.MR 1165734 (93f:11021)

6.
-, Barker arrays I: Even number of elements, SIAM J. Discrete Math. 6 (1993), 294-308.MR 1215236 (94k:05047a)

7.
J. Jedwab, A survey of the merit factor problem for binary sequences, Sequences and Their Applications -- Proceedings of SETA 2004 (T. Helleseth et al., eds.), Lecture Notes in Computer Science, vol. 3486, Springer-Verlag, Berlin, Heidelberg, 2005, pp. 30-55.

8.
J. Jedwab, S. Lloyd, and M. Mowbray, Barker arrays II: Odd number of elements, SIAM J. Discrete Math. 6 (1993), 309-328. MR 1215237 (94k:05047b)

9.
J. Jedwab and K. Yoshida, The peak sidelobe level of families of binary sequences, IEEE Trans. Inform. Theory 52 (2006), 2247-2254.

10.
K.H. Leung, S.L. Ma, and B. Schmidt, Nonexistence of abelian difference sets: Lander's conjecture for prime power orders, Trans. Amer. Math. Soc. 356 (2004), 4343-4358.MR 2067122 (2005f:05025)

11.
K.H. Leung and B. Schmidt, The field descent method, Designs, Codes and Cryptography 36 (2005), 171-188.

12.
A. Pott, Finite geometry and character theory, Lecture Notes in Mathematics 1601, Springer-Verlag, Berlin, 1995.MR 1440858 (98j:05032)

13.
G.S. Ramakrishna and W.H. Mow, A new search for optimal binary arrays with minimum peak sidelobe levels, Sequences and Their Applications -- Proceedings of SETA 2004 (T. Helleseth et al., eds.), Lecture Notes in Computer Science, vol. 3486, Springer-Verlag, Berlin, Heidelberg, 2005, pp. 355-360.

14.
H.D. Schotten and H.D. Lüke, On the search for low correlated binary sequences, AEU -- Int. J. of Electronics and Communications 59 (2005), 67-78.

15.
R. Turyn and J. Storer, On binary sequences, Proc. Amer. Math. Soc. 12 (1961), 394-399.MR 0125026 (23:A2333)

16.
R.J. Turyn, Sequences with small correlation, Error Correcting Codes (H.B. Mann, ed.), Wiley, New York, 1968, pp. 195-228. MR 0242566 (39:3897)

17.
P. Wild, Infinite families of perfect binary arrays, Electron. Lett. 24 (1988), 845-847.


Similar Articles:

Retrieve articles in Proceedings of the American Mathematical Society with MSC (2000): 05B10, 94A99

Retrieve articles in all Journals with MSC (2000): 05B10, 94A99


Additional Information:

James A. Davis
Affiliation: Department of Mathematics and Computer Science, University of Richmond, Richmond, Virginia 23173
Email: jdavis@richmond.edu

Jonathan Jedwab
Affiliation: Department of Mathematics, Simon Fraser University, 8888 University Drive, Burnaby, British Columbia, Canada V5A 1S6
Email: jed@sfu.ca

Ken W. Smith
Affiliation: Department of Mathematics, Central Michigan University, Mount Pleasant, Michigan 48859
Email: Ken.W.Smith@cmich.edu

DOI: 10.1090/S0002-9939-07-08703-5
PII: S 0002-9939(07)08703-5
Keywords: Barker array, difference set, relative difference set, perfect array, quasiperfect array
Received by editor(s): October 25, 2005
Received by editor(s) in revised form: March 10, 2006
Posted: March 2, 2007
Additional Notes: The first author was supported by grant # MDA904-03-1-0032 (NSA)
The second author was supported by grant # 31-611394 (NSERC Canada)
The third author received sabbatical support from Central Michigan University and gracious hospitality from the University of Richmond
Communicated by: John R. Stembridge
Copyright of article: Copyright 2007, American Mathematical Society
The copyright for this article reverts to public domain after 28 years from publication.


  AMS Website Logo Small Comments: webmaster@ams.org
© Copyright 2009, American Mathematical Society
Privacy Statement
Search the AMSPowered by Google