{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,4]],"date-time":"2024-07-04T00:58:18Z","timestamp":1720054698599},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1992,9,1]],"date-time":"1992-09-01T00:00:00Z","timestamp":715305600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7624,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1992,9]]},"DOI":"10.1016\/0012-365x(92)90577-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:34Z","timestamp":1027640614000},"page":"471-477","source":"Crossref","is-referenced-by-count":6,"special_numbering":"C","title":["On the cardinality of sets of sequences with given maximum correlation"],"prefix":"10.1016","volume":"106-107","author":[{"given":"Aimo","family":"Tiet\u00e4v\u00e4inen","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(92)90577-3_BIB1","article-title":"An algebraic approach to the association schemes of coding theory","volume":"10","author":"Delsarte","year":"1973","journal-title":"Philips Res. Rep. Suppl."},{"key":"10.1016\/0012-365X(92)90577-3_BIB2","first-page":"619","article-title":"Optimal binary sequences for spread-spectrum multiplexing","volume":"14","author":"Gold","year":"1968","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0012-365X(92)90577-3_BIB3","series-title":"Proc. Conf. on Combinatorial Mathematics and Its Applications","article-title":"Weight distribution of Bose-Chaudhury-Hocquenghem codes","author":"Kasami","year":"1968"},{"key":"10.1016\/0012-365X(92)90577-3_BIB4","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1109\/18.54881","article-title":"On lower bounds to the maximum correlation of complex roots-of-unity sequences","volume":"36","author":"Vijay Kumar","year":"1990","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0012-365X(92)90577-3_BIB5","unstructured":"P. Vijay Kumar and O. Moreno, Polyphase sequences with periodic correlation properties better than binary sequences, IEEE Trans. Inform. Theory, to appear."},{"key":"10.1016\/0012-365X(92)90577-3_BIB6","unstructured":"J. Lahtonen and H. Tarnanen, A new upper bound for the number of binary vectors with a given maximum correlation magnitude, to appear."},{"key":"10.1016\/0012-365X(92)90577-3_BIB7","first-page":"1303","article-title":"Bounds on the maximum size of a code with limited scalar product modulus","volume":"263","author":"Levenshtein","year":"1982","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"10.1016\/0012-365X(92)90577-3_BIB8","series-title":"Introduction to Coding Theory","author":"van Lint","year":"1982"},{"key":"10.1016\/0012-365X(92)90577-3_BIB9","series-title":"The Theory of Error-Correcting Codes","author":"MacWilliams","year":"1977"},{"key":"10.1016\/0012-365X(92)90577-3_BIB10","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1109\/TIT.1977.1055688","article-title":"New upper bounds on the rate of a code via Delsarte-MacWilliams Inequalities","volume":"23","author":"McEliece","year":"1977","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0012-365X(92)90577-3_BIB11","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1109\/PROC.1980.11697","article-title":"Crosscorrelation properties of pseudorandom and related sequences","volume":"68","author":"Sarwate","year":"1980","journal-title":"Proc. IEEE"},{"key":"10.1016\/0012-365X(92)90577-3_BIB12","first-page":"15","article-title":"On mutual correlation of sequences","volume":"24","author":"Sidelnikov","year":"1971","journal-title":"Problemy Kibernet."},{"key":"10.1016\/0012-365X(92)90577-3_BIB13","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0012-365X(85)90180-3","article-title":"On character sums and codes","volume":"57","author":"Tarnanen","year":"1985","journal-title":"Discrete Math."},{"issue":"2","key":"10.1016\/0012-365X(92)90577-3_BIB14","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1112\/jlms\/s2-29.2.204","article-title":"Lower bounds for the maximum moduli of certain character sums","volume":"29","author":"Tiet\u00e4v\u00e4inen","year":"1984","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0012-365X(92)90577-3_BIB15","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1109\/TIT.1974.1055219","article-title":"Lower bounds on the maximum correlation of signals","volume":"20","author":"Welch","year":"1974","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X92905773?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X92905773?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:27:56Z","timestamp":1555118876000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X92905773"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,9]]},"references-count":15,"alternative-id":["0012365X92905773"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(92)90577-3","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1992,9]]}}}