On a class of polynomials related to Barker sequences
HTML articles powered by AMS MathViewer
- by Peter Borwein, Stephen Choi and Jonas Jankauskas
- Proc. Amer. Math. Soc. 140 (2012), 2613-2625
- DOI: https://doi.org/10.1090/S0002-9939-2011-11114-6
- Published electronically: December 8, 2011
- PDF | Request permission
Abstract:
For an odd integer $n > 0$, we introduce the class $\mathcal {L}P_n$ of Laurent polynomials \[ P(z) = (n+1) + \sum _{\substack {k = 1 \\ k \text { odd}}}^{n}c_k (z^k+z^{-k}), \] with all coefficients $c_k$ equal to $-1$ or $1$. Such polynomials arise in the study of Barker sequences of even length, i.e., integer sequences having minimal possible autocorrelations. We prove that polynomials $P \in \mathcal {L}P_n$ have large Mahler measures, namely, $M(P) > (n+1)/2$. We conjecture that minimal Mahler measures in the class $\mathcal {L}P_n$ are attained by the polynomials $R_n(z)$ and $R_n(-z)$, where \[ R_n(z) = (n+1) + \sum _{\substack {k = -n \\ k \text { odd}}}^{n} z^k \] is a polynomial with all the coefficients $c_k=1$. We prove that \[ M(R_n) > n - \frac {2}{\pi } \log {n} + O(1). \] The results of experimental computations on polynomials in the class $\mathcal {L}P_n$ suggest two conjectures which could shed light on the long-standing Barker problem.References
- R.H. Barker, Group synchronizing of binary digital systems, Communication theory, 273–287, Butterworths Sci. Pub., London, 1953.
- Peter Borwein, Erich Kaltofen, and Michael J. Mossinghoff, Irreducible polynomials and Barker sequences, ACM Commun. Comput. Algebra 41 (2007), no. 3-4, 118–121. MR 2404490, DOI 10.1145/1358183.1358185
- Peter Borwein and Michael J. Mossinghoff, Barker sequences and flat polynomials, Number theory and polynomials, London Math. Soc. Lecture Note Ser., vol. 352, Cambridge Univ. Press, Cambridge, 2008, pp. 71–88. MR 2428516, DOI 10.1017/CBO9780511721274.007
- Shalom Eliahou and Michel Kervaire, Barker sequences and difference sets, Enseign. Math. (2) 38 (1992), no. 3-4, 345–382. MR 1189012
- Shalom Eliahou, Michel Kervaire, and Bahman Saffari, A new restriction on the lengths of Golay complementary sequences, J. Combin. Theory Ser. A 55 (1990), no. 1, 49–59. MR 1070014, DOI 10.1016/0097-3165(90)90046-Y
- P. Fan, M. Darnell, Sequence design for communications applications, Research Studies Press, Somerset, England, 1996.
- J. Jedwab, A survey of the merit factor problem for binary sequences, Sequences and Their Applications, Proceedings of SETA 2004, Lecture Notes in Computer Science 3486, 30–55, Springer Verlag, Berlin, 2005.
- Jonathan Jedwab and Sheelagh Lloyd, A note on the nonexistence of Barker sequences, Des. Codes Cryptogr. 2 (1992), no. 1, 93–97. MR 1157481, DOI 10.1007/BF00124212
- Michael J. Mossinghoff, Wieferich pairs and Barker sequences, Des. Codes Cryptogr. 53 (2009), no. 3, 149–163. MR 2545689, DOI 10.1007/s10623-009-9301-3
- D. J. Newman, Norms of polynomials, Amer. Math. Monthly 67 (1960), 778–779. MR 125205, DOI 10.2307/2308661
- D. J. Newman, An $L^{1}$ extremal problem for polynomials, Proc. Amer. Math. Soc. 16 (1965), 1287–1290. MR 185119, DOI 10.1090/S0002-9939-1965-0185119-4
- Ka Hin Leung and Bernhard Schmidt, The field descent method, Des. Codes Cryptogr. 36 (2005), no. 2, 171–188. MR 2211106, DOI 10.1007/s10623-004-1703-7
- B. Saffari, Barker sequences and Littlewood’s “two-sided conjectures” on polynomials with $\pm 1$ coefficients, Séminaire d’Analyse Harmonique. Année 1989/90, Univ. Paris XI, Orsay, 1990, pp. 139–151. MR 1104693
- Chris Smyth, The Mahler measure of algebraic numbers: a survey, Number theory and polynomials, London Math. Soc. Lecture Note Ser., vol. 352, Cambridge Univ. Press, Cambridge, 2008, pp. 322–349. MR 2428530, DOI 10.1017/CBO9780511721274.021
- R. Turyn, On Barker codes of even length, IEEE Trans. Inform. Theory 51 (1963), no. 9, 1256.
- Richard J. Turyn, Character sums and difference sets, Pacific J. Math. 15 (1965), 319–346. MR 179098
- R. Turyn, Sequences with small correlation, Error Correcting Codes (Proc. Sympos. Math. Res. Center, Madison, Wis., 1968), John Wiley, New York, 1968, pp. 195–228. MR 0242566
- R. Turyn and J. Storer, On binary sequences, Proc. Amer. Math. Soc. 12 (1961), 394–399. MR 125026, DOI 10.1090/S0002-9939-1961-0125026-2
- J. E. Littlewood, On polynomials $\sum ^{n}\pm z^{m}$, $\sum ^{n}e^{\alpha _{m}i}z^{m}$, $z=e^{\theta _{i}}$, J. London Math. Soc. 41 (1966), 367–376. MR 196043, DOI 10.1112/jlms/s1-41.1.367
- John E. Littlewood, Some problems in real and complex analysis, D. C. Heath and Company Raytheon Education Company, Lexington, Mass., 1968. MR 0244463
Bibliographic Information
- Peter Borwein
- Affiliation: Department of Mathematics, Simon Fraser University, 8888 University Drive, Burnaby, British Columbia V5A 1S6, Canada
- Email: pborwein@sfu.ca
- Stephen Choi
- Affiliation: Department of Mathematics, Simon Fraser University, 8888 University Drive, Burnaby, British Columbia V5A 1S6, Canada
- Email: kkchoi@math.sfu.ca
- Jonas Jankauskas
- Affiliation: Department of Mathematics and Informatics, Vilnius University, Naugarduko 24, Vilnius LT-03225, Lithuania
- MR Author ID: 825362
- ORCID: 0000-0001-9770-7632
- Email: jonas.jankauskas@gmail.com
- Received by editor(s): January 23, 2011
- Received by editor(s) in revised form: March 6, 2011
- Published electronically: December 8, 2011
- Additional Notes: The first and second authors are supported by NSERC, Canada.
A visit of the third author at IRMACS Center, Simon Fraser University, was funded by the Lithuanian Research Council (student research support project). - Communicated by: Matthew A. Papanikolas
- © Copyright 2011
American Mathematical Society
The copyright for this article reverts to public domain 28 years after publication. - Journal: Proc. Amer. Math. Soc. 140 (2012), 2613-2625
- MSC (2010): Primary 11B83, 11C08, 30C10; Secondary 42A05, 94A05
- DOI: https://doi.org/10.1090/S0002-9939-2011-11114-6
- MathSciNet review: 2910749