{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,16]],"date-time":"2023-02-16T11:53:46Z","timestamp":1676548426705},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2019,11,6]],"date-time":"2019-11-06T00:00:00Z","timestamp":1572998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,6]],"date-time":"2019-11-06T00:00:00Z","timestamp":1572998400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s00493-019-4134-9","type":"journal-article","created":{"date-parts":[[2019,11,6]],"date-time":"2019-11-06T12:03:12Z","timestamp":1573041792000},"page":"1425-1428","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The Independence Number of the Orthogonality Graph in Dimension 2k"],"prefix":"10.1007","volume":"39","author":[{"given":"Ferdinand","family":"Ihringer","sequence":"first","affiliation":[]},{"given":"Hajime","family":"Tanaka","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,6]]},"reference":[{"key":"4134_CR1","first-page":"219","volume-title":"Invariant semidef-inite programs, in: Handbook on semidefinite, conic and polynomial optimization (M. F. Anjos and J. B. Lasserre, eds.), Springer, New York","author":"C Bachoc","year":"2012","unstructured":"C. Bachoc, D. C. Gijswijt, A. Schrijver and F. Vallentin: Invariant semidef-inite programs, in: Handbook on semidefinite, conic and polynomial optimization (M. F. Anjos and J. B. Lasserre, eds.), Springer, New York, 2012, 219\u2013269."},{"key":"4134_CR2","doi-asserted-by":"publisher","first-page":"1874","DOI":"10.1103\/PhysRevLett.83.1874","volume":"83","author":"G Brassard","year":"1999","unstructured":"G. Brassard, R. Cleve and A. Tapp: Cost of exactly simulating quantum entanglement with classical communication, Phys. Rev. Lett. 83 (1999), 1874\u20131877.","journal-title":"Phys. Rev. Lett"},{"key":"4134_CR3","first-page":"63","volume-title":"Quantum vs. classical communication and computation, in: Proceedings of the 30th Annual ACM Symposium on the Theory of Computing, Dallas, TX, USA","author":"H Buhrman","year":"1998","unstructured":"H. Buhrman, R. Cleve and A. Widgerson: Quantum vs. classical communication and computation, in: Proceedings of the 30th Annual ACM Symposium on the Theory of Computing, Dallas, TX, USA, 1998, 63\u201368."},{"key":"4134_CR4","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1016\/j.ejc.2009.03.045","volume":"31","author":"P J Cameron","year":"2010","unstructured":"P. J. Cameron: Problems from CGCS Luminy, May 2007, European J. Combin. 31 (2010), 644\u2013648.","journal-title":"European J. Combin"},{"key":"4134_CR5","unstructured":"P. Delsarte: An algebraic approach to the association schemes of coding theory, Philips Res. Rep. Suppl., No. 10, 1973."},{"key":"4134_CR6","doi-asserted-by":"publisher","first-page":"589","DOI":"10.2307\/2304500","volume":"54","author":"N J Fine","year":"1947","unstructured":"N. J. Fine: Binomial coefficients modulo a prime, Amer. Math. Monthly 54 (1947), 589\u2013592.","journal-title":"Amer. Math. Monthly"},{"key":"4134_CR7","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF02579389","volume":"6","author":"P Frankl","year":"1986","unstructured":"P. Frankl: Orthogonal vectors in the n-dimensional cube and codes with missing distances, Combinatorica 6 (1986), 279\u2013285.","journal-title":"Combinatorica"},{"key":"4134_CR8","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1090\/S0002-9947-1987-0871675-6","volume":"300","author":"P Frankl","year":"1987","unstructured":"P. Frankl and V. R\u00f6dl: Forbidden intersections, Trans. Amer. Math. Soc. 300 (1987), 259\u2013286.","journal-title":"Trans. Amer. Math. Soc"},{"key":"4134_CR9","volume-title":"Classical pseudo-telepathy and colouring graphs, diploma thesis, ETH Zurich","author":"V Galliard","year":"2001","unstructured":"V. Galliard: Classical pseudo-telepathy and colouring graphs, diploma thesis, ETH Zurich, 2001; available at \nhttps:\/\/doi.org\/math.galliard.ch\/Cryptography\/Papers\/PseudoTelepathy\/SimulationOfEntanglement.pdf\n\n."},{"key":"4134_CR10","volume-title":"The impossibility of pseudo-telepathy without quantum entanglement, in: Proceedings 2003 IEEE International Symposium on Information Theory, Yokohama, Japan","author":"V Galliard","year":"2003","unstructured":"V. Galliard, A. Tapp and S. Wolf: The impossibility of pseudo-telepathy without quantum entanglement, in: Proceedings 2003 IEEE International Symposium on Information Theory, Yokohama, Japan, 2003."},{"key":"4134_CR11","doi-asserted-by":"publisher","first-page":"2697","DOI":"10.1109\/TIT.2012.2184845","volume":"58","author":"D C Gijswijt","year":"2012","unstructured":"D. C. Gijswijt, H. D. Mittelmann and A. Schrijver: Semidefinite code bounds based on quadruple distances, IEEE Trans. Inform. Theory 58 (2012), 2697\u20132705.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4134_CR12","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1137\/050639715","volume":"22","author":"C D Godsil","year":"2008","unstructured":"C. D. Godsil and M. W. Newman: Coloring an orthogonality graph, SIAM J. Discrete Math. 22 (2008), 683\u2013692.","journal-title":"SIAM J. Discrete Math"},{"key":"4134_CR13","doi-asserted-by":"publisher","first-page":"1971","DOI":"10.1016\/j.ejc.2006.08.011","volume":"28","author":"E de Klerk","year":"2007","unstructured":"E. de Klerk and D. V. Pasechnik: A note on the stability number of an orthogonality graph, European J. Combin. 28 (2007), 1971\u20131979.","journal-title":"European J. Combin"},{"key":"4134_CR14","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10107-006-0030-3","volume":"109","author":"M Laurent","year":"2007","unstructured":"M. Laurent: Strengthened semidefinite programming bounds for codes, Math. Program. 109 (2007), 239\u2013261.","journal-title":"Math. Program"},{"key":"4134_CR15","volume-title":"thesis, University of Waterloo","author":"M W Newman","year":"2004","unstructured":"M. W. Newman: Independent sets and eigenspaces, thesis, University of Waterloo, 2004."},{"key":"4134_CR16","doi-asserted-by":"publisher","first-page":"2859","DOI":"10.1109\/TIT.2005.851748","volume":"51","author":"A Schrijver","year":"2005","unstructured":"A. Schrijver: New code upper bounds from the Terwilliger algebra and semidefinite programming, IEEE Trans. Inform. Theory 51 (2005), 2859\u20132866.","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-019-4134-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-019-4134-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-019-4134-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,5]],"date-time":"2020-11-05T00:32:09Z","timestamp":1604536329000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-019-4134-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,6]]},"references-count":16,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["4134"],"URL":"https:\/\/doi.org\/10.1007\/s00493-019-4134-9","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,6]]},"assertion":[{"value":"14 January 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 May 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 November 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}