{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,12]],"date-time":"2022-06-12T11:09:59Z","timestamp":1655032199180},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,3,1]],"date-time":"2009-03-01T00:00:00Z","timestamp":1235865600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Period Math Hung"],"published-print":{"date-parts":[[2009,3]]},"DOI":"10.1007\/s10998-009-9099-x","type":"journal-article","created":{"date-parts":[[2009,3,13]],"date-time":"2009-03-13T01:15:37Z","timestamp":1236906937000},"page":"99-120","source":"Crossref","is-referenced-by-count":5,"title":["Concatenation of pseudorandom binary sequences"],"prefix":"10.1007","volume":"58","author":[{"given":"Katalin","family":"Gyarmati","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,3,14]]},"reference":[{"key":"9099_CR1","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1023\/A:1025962825241","volume":"46","author":"R. Ahlswede","year":"2003","unstructured":"R. Ahlswede, L.H. Khachatrian, C. Mauduit and A. S\u00e1rk\u00f6zy, A complexity measure for families of binary sequences, Period. Math. Hungar., 46 (2003), 107\u2013118.","journal-title":"Period. Math. Hungar."},{"key":"9099_CR2","unstructured":"R. Ahlswede, C. Mauduit and A. S\u00e1rk\u00f6zy, Large families of pseudorandom sequences of k symbols and their complexity, Part I, Part II, General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer Science, Vol. 4123, Springer Verlag, 293\u2013307."},{"key":"9099_CR3","doi-asserted-by":"crossref","unstructured":"V. Anantharam, A technique to study the correlation measures of binary sequences, Discrete Math., to appear.","DOI":"10.1016\/j.disc.2007.11.043"},{"key":"9099_CR4","first-page":"394","volume-title":"22nd Annual Symposium on Foundations of Computer Science","author":"M. Ben-Or","year":"1981","unstructured":"M. Ben-Or, Probabilistic algorithms in finite fields, 22nd Annual Symposium on Foundations of Computer Science, IEEE, New York, 1981, 394\u2013398."},{"key":"9099_CR5","doi-asserted-by":"crossref","first-page":"97","DOI":"10.4064\/aa103-2-1","volume":"103","author":"J. Cassaigne","year":"2002","unstructured":"J. Cassaigne, C. Mauduit and A. S\u00e1rk\u00f6zy, On finite pseudorandom binary sequences VII: The measures of pseudorandomness, Acta Arith., 103 (2002), 97\u2013118.","journal-title":"Acta Arith."},{"key":"9099_CR6","unstructured":"E. Galois, Sur la th\u00e9orie des nombres, \u00c9crits et M\u00e9moires Math\u00e9matiques d\u2019\u00c9vareste Galois, (R. Bourgne and J.-P. Arza eds.), Gauthier-Villars, 1830, 112\u2013128."},{"key":"9099_CR7","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/j.jnt.2003.12.002","volume":"106","author":"L. Goubin","year":"2004","unstructured":"L. Goubin, C. Mauduit and A. S\u00e1rk\u00f6zy, Construction of large families of pseudorandom binary sequences, J. Number Theory, 106 (2004), 56\u201369.","journal-title":"J. Number Theory"},{"key":"9099_CR8","first-page":"87","volume":"49","author":"K. Gyarmati","year":"2006","unstructured":"K. Gyarmati, A note to the paper \u201cOn a fast version of a pseudorandom generator\u201d, Ann. Univ. Sci. Budapest. E\u00f6tv\u00f6s Sect. Math., 49 (2006), 87\u201393.","journal-title":"Ann. Univ. Sci. Budapest. E\u00f6tv\u00f6s Sect. Math."},{"key":"9099_CR9","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s10998-004-0522-y","volume":"49","author":"K. Gyarmati","year":"2004","unstructured":"K. Gyarmati, On a family of pseudorandom binary sequences, Period. Math. Hungar., 49 (2004), 45\u201363.","journal-title":"Period. Math. Hungar."},{"key":"9099_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1007\/11889342_18","volume-title":"General Theory of Information Transfer and Combinatorics","author":"K. Gyarmati","year":"2006","unstructured":"K. Gyarmati, On a fast version of a pseudorandom generator, General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer Science, Springer, Berlin \u2014 Heidelberg, 2006, 326\u2013342."},{"key":"9099_CR11","doi-asserted-by":"crossref","first-page":"359","DOI":"10.4064\/aa118-4-3","volume":"118","author":"K. Gyarmati","year":"2005","unstructured":"K. Gyarmati, A. S\u00e1rk\u00f6zy and A. Peth\u0151, On linear recursion and pseudorandomness, Acta Arith., 118 (2005), 359\u2013374.","journal-title":"Acta Arith."},{"key":"9099_CR12","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/s10998-005-0031-7","volume":"51","author":"J. Rivat","year":"2005","unstructured":"J. Rivat and A. S\u00e1rk\u00f6zy, Modular construction of pseudorandom binary sequences with composite moduli, Period. Math. Hungar., 51 (2005), 75\u2013107.","journal-title":"Period. Math. Hungar."},{"key":"9099_CR13","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/s00605-003-0112-8","volume":"141","author":"C. Mauduit","year":"2004","unstructured":"C. Mauduit, J. Rivat and A. S\u00e1rk\u00f6zy, Construction of pseudorandom binary sequences using additive characters, Monatsh. Math., 141 (2004), 197\u2013208.","journal-title":"Monatsh. Math."},{"key":"9099_CR14","doi-asserted-by":"crossref","first-page":"365","DOI":"10.4064\/aa-82-4-365-377","volume":"82","author":"C. Mauduit","year":"1997","unstructured":"C. Mauduit and A. S\u00e1rk\u00f6zy, On finite pseudorandom binary sequence I: Measures of pseudorandomness, the Legendre symbol, Acta Arith., 82 (1997), 365\u2013377.","journal-title":"Acta Arith."},{"key":"9099_CR15","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1090\/S0002-9904-1893-00178-X","volume":"3","author":"E. H. Moore","year":"1893","unstructured":"E. H. Moore, A doubly-infinite system of simple groups, Bull. Amer. Math. Soc., 3 (1893), 73\u201378.","journal-title":"Bull. Amer. Math. Soc."},{"key":"9099_CR16","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1137\/0209024","volume":"9","author":"M. O. Rabin","year":"1980","unstructured":"M. O. Rabin, Probabilistic algorithms in finite fields, SIAM J. Comput., 9 (1980), 273\u2013280.","journal-title":"SIAM J. Comput."},{"key":"9099_CR17","volume-title":"Algebra","author":"L. R\u00e9dei","year":"1967","unstructured":"L. R\u00e9dei, Algebra, Pergamon Press, Oxford \u2014 New York \u2014 Toronto Ont., 1967."},{"key":"9099_CR18","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1006\/jsco.1994.1025","volume":"17","author":"V. Shoup","year":"1994","unstructured":"V. Shoup, Fast construction of irreducible polynomials over finite fields, J. Symbolic Computation, 17 (1994), 371\u2013391.","journal-title":"J. Symbolic Computation"},{"key":"9099_CR19","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/s10998-007-4185-1","volume":"55","author":"V. T\u00f3th","year":"2007","unstructured":"V. T\u00f3th, Collision and avalanche effect in famillies of pseudorandom binary sequences, Period. Math. Hungar., 55 (2007), 185\u2013196.","journal-title":"Period. Math. Hungar."},{"key":"9099_CR20","series-title":"Actualit\u00e9s Sci. Ind.","volume-title":"Sur les courbes alg\u00e9briques et les vari\u00e9t\u00e9s qui s\u2019en d\u00e9duisent","author":"A. Weil","year":"1948","unstructured":"A. Weil, Sur les courbes alg\u00e9briques et les vari\u00e9t\u00e9s qui s\u2019en d\u00e9duisent, Actualit\u00e9s Sci. Ind. 1041, Hermann, Paris, 1948."}],"container-title":["Periodica Mathematica Hungarica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10998-009-9099-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10998-009-9099-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10998-009-9099-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T01:53:01Z","timestamp":1559353981000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10998-009-9099-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,3]]}},"alternative-id":["9099"],"URL":"https:\/\/doi.org\/10.1007\/s10998-009-9099-x","relation":{},"ISSN":["0031-5303","1588-2829"],"issn-type":[{"value":"0031-5303","type":"print"},{"value":"1588-2829","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,3]]}}}