{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T11:08:05Z","timestamp":1777547285883,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540314233","type":"print"},{"value":"9783540314240","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11617983_4","type":"book-chapter","created":{"date-parts":[[2006,1,12]],"date-time":"2006-01-12T12:27:38Z","timestamp":1137068858000},"page":"51-59","source":"Crossref","is-referenced-by-count":16,"title":["The Merit Factor Problem for Binary Sequences"],"prefix":"10.1007","author":[{"given":"Tom","family":"H\u00f8holdt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"4_CR1","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1109\/TIT.1977.1055653","volume":"IT-23","author":"M.J.E. Golay","year":"1977","unstructured":"Golay, M.J.E.: Sieves for low autocorrelation binary sequences. IEEE Trans. Inform. Theory\u00a0IT-23(1), 43\u201351 (1977)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"4_CR2","doi-asserted-by":"publisher","first-page":"42","DOI":"10.2307\/2324003","volume":"97","author":"D.J. Newman","year":"1990","unstructured":"Newman, D.J., Byrnes, J.S.: The L4 Norm of a Polynomial with Coeffcients \u00b11. Amer. Math. Monthly\u00a097(1), 42\u201345 (1990)","journal-title":"Amer. Math. Monthly"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1049\/el:19750391","volume":"11","author":"J. Lindner","year":"1975","unstructured":"Lindner, J.: Binary sequences up to length 40 with best possible autocorrelation function. Electron. Lett.\u00a011, 507 (1975)","journal-title":"Electron. Lett."},{"issue":"1","key":"4_CR4","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/S0166-218X(99)00085-2","volume":"95","author":"D. Jungnickel","year":"1999","unstructured":"Jungnickel, D., Pott, A.: Perfect and almost perfect sequences. Discrete Applied Math.\u00a095(1), 331\u2013359 (1999)","journal-title":"Discrete Applied Math."},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1080\/02331939208843771","volume":"23","author":"C. Groot de","year":"1991","unstructured":"de Groot, C., W\u00fcrtz, D., Hoffmann, K.H.: Low autocorrelation binary sequences: Exact enumeration and optimization by evolutionary strategies. Optimization\u00a023, 369\u2013384 (1991)","journal-title":"Optimization"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1088\/0305-4470\/29\/18\/005","volume":"29","author":"S. Mertens","year":"1996","unstructured":"Mertens, S.: Exhaustive search for low-autocorrelation binary sequences. J. Phys. A\u00a029, 473\u2013481 (1996)","journal-title":"J. Phys. A"},{"key":"4_CR7","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1051\/jphys:01987004804055900","volume":"48","author":"J. Bernasconi","year":"1987","unstructured":"Bernasconi, J.: Low autocorrelation binary sequences: Statistical mechanics and configuration space analysis. J. Phys.\u00a048, 559\u2013567 (1987)","journal-title":"J. Phys."},{"issue":"5","key":"4_CR8","first-page":"289","volume":"40","author":"G.F.M. Bencker","year":"1985","unstructured":"Bencker, G.F.M., Claasen, T.A.C.M., Heimes, P.W.C.: Binary sequences with a maximally at amplitude spectrum. Phillips J. Res.\u00a040(5), 289\u2013304 (1985)","journal-title":"Phillips J. Res."},{"issue":"4","key":"4_CR9","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1109\/TIT.1985.1057071","volume":"IT-31","author":"T. H\u00f8holdt","year":"1985","unstructured":"H\u00f8holdt, T., Elbr\u00f8nd Jensen, H., Justesen, J.: Aperiodic Correlations and the Merit Factor of a class of Binary Sequences. IEEE Trans. Inform. Theory\u00a0IT-31(4), 549\u2013552 (1985)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1090\/S0002-9939-1959-0116184-5","volume":"10","author":"W. Rudin","year":"1959","unstructured":"Rudin, W.: Some theorems on Fourier coefficients. Proc. Amer. Math. Soc.\u00a010, 855\u2013859 (1959)","journal-title":"Proc. Amer. Math. Soc."},{"key":"4_CR11","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0061260","volume-title":"Cyclic Difference Sets","author":"L.D. Baumert","year":"1971","unstructured":"Baumert, L.D.: Cyclic Difference Sets. Lecture Notes in Mathematics, vol.\u00a0189. Springer, Berlin (1971)"},{"issue":"3","key":"4_CR12","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1109\/18.79917","volume":"37","author":"J.M. Jensen","year":"1991","unstructured":"Jensen, J.M., Elbr\u00f8nd Jensen, H., H\u00f8holdt, T.: The Merit Factor of Binary Sequences Related to Difference Sets. IEEE Trans. Inform. Theory\u00a037(3), 617\u2013626 (1991)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"4_CR13","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1109\/18.2620","volume":"34","author":"T. H\u00f8holdtand","year":"1988","unstructured":"H\u00f8holdtand, T., Elbr\u00f8nd Jensen, H.: Determination of the Merit Factor of Legendre Sequences. IEEE Trans. Inform. Theory\u00a034(1), 161\u2013164 (1988)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"4_CR14","first-page":"934","volume":"IT-29","author":"M.J.E. Golay","year":"1982","unstructured":"Golay, M.J.E.: The merit factor of Legendre sequences. IEEE Trans. Inform. Theory\u00a0IT-29(6), 934\u2013936 (1982)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4_CR15","volume-title":"Aufgeben und Lehrs\u00e4tze aus der Analyse II","author":"G. Polya","year":"1925","unstructured":"Polya, G., Szeg\u00f6, G.: Aufgeben und Lehrs\u00e4tze aus der Analyse II. Springer, Berlin (1925)"},{"key":"4_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-1983-2","volume-title":"Finite Fields for Computer Scientists and Engineers","author":"R.J. McEliece","year":"1987","unstructured":"McEliece, R.J.: Finite Fields for Computer Scientists and Engineers. Kluwer Academics, Boston (1987)"},{"issue":"3","key":"4_CR17","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1109\/7.192096","volume":"24","author":"H.D. L\u00fcke","year":"1988","unstructured":"L\u00fcke, H.D.: Sequences and arrays with perfect periodic correlation. IEEE Trans. Aerospace Electron. Systems\u00a024(3), 287\u2013294 (1988)","journal-title":"IEEE Trans. Aerospace Electron. Systems"},{"key":"4_CR18","doi-asserted-by":"crossref","first-page":"3224","DOI":"10.1109\/TIT.2004.838341","volume":"50","author":"P. Borwein","year":"2004","unstructured":"Borwein, P., Choi, K.-K.S., Jedwab, J.: Binary sequences with merit factor greater than 6.34. IEEE-Trans.Inform. Theory\u00a050, 3224\u20133249 (2004)","journal-title":"IEEE-Trans.Inform. Theory"},{"key":"4_CR19","unstructured":"Borwein, P., Ferguson, R., Knauer, J.: The merit factor of binary sequences (In preparation)"},{"key":"4_CR20","unstructured":"Knauer, J.: Merit Factor Records. Online Available: http:\/\/www.cecm.sfu.ca\/~jknauer\/labs\/records.html"},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"3385","DOI":"10.1109\/TIT.2004.838343","volume":"50","author":"R. Kristiansen","year":"2004","unstructured":"Kristiansen, R., Parker, M.: Binary sequences with merit factor >6:3. IEEE Trans. Inform. Theory\u00a050, 3385\u20133389 (2004)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Jedwab, J.: A Survey of the Merit Factor Problem for Binary Sequences (December 2004) (Preprint)","DOI":"10.1007\/11423461_2"},{"key":"4_CR23","series-title":"NATO Science Series C","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/978-94-011-4459-9_9","volume-title":"Difference Sets, Sequences and Their Correlation Properties","author":"T. H\u00f8holdt","year":"1999","unstructured":"H\u00f8holdt, T.: The Merit Factor of Binary Sequences. In: Pott, A., et al. (eds.) Difference Sets, Sequences and Their Correlation Properties. NATO Science Series C, vol.\u00a0542, pp. 227\u2013237. Kluwer Academic Publishers, Dordrecht (1999)"},{"key":"4_CR24","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1112\/jlms\/s1-41.1.367","volume":"41","author":"J.E. Littlewood","year":"1966","unstructured":"Littlewood, J.E.: On polynomials \u2211\u2009 n \u00b1z m , \u2211 n e \u03b1 m i z m , z = e \u03b8 i . J. London Math. Soc.\u00a041, 367\u2013376 (1966)","journal-title":"J. London Math. Soc."},{"key":"4_CR25","unstructured":"Kirilusha, A., Narayanaswamy, G.: Construction of new asymptotic classes of binary sequences based on existing asymptotic classes. Summer Science Program Technical Report, Dept. Math. Comput. Science, University of Richmond (July 1999)"}],"container-title":["Lecture Notes in Computer Science","Applied Algebra, Algebraic Algorithms and Error-Correcting Codes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11617983_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T02:38:25Z","timestamp":1736217505000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11617983_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540314233","9783540314240"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11617983_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}