{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T10:41:44Z","timestamp":1772448104257,"version":"3.50.1"},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1986,9,1]],"date-time":"1986-09-01T00:00:00Z","timestamp":525916800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1986,9]]},"DOI":"10.1007\/bf02579389","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T22:20:17Z","timestamp":1174602017000},"page":"279-285","source":"Crossref","is-referenced-by-count":20,"title":["Orthogonal vectors in then-dimensional cube and codes with missing distances"],"prefix":"10.1007","volume":"6","author":[{"given":"P.","family":"Frankl","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02579389_CR1","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/S0019-9958(73)80007-5","volume":"23","author":"Ph. Delsarte","year":"1973","unstructured":"Ph. Delsarte, On the four principal parameters of a code,Information and Control 23 (1973), 407\u2013438.","journal-title":"Information and Control"},{"key":"BF02579389_CR2","unstructured":"P. Frankl andV. R\u00f6dl, Forbidden intersections,Transactions AMS, to appear."},{"key":"BF02579389_CR3","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF02579457","volume":"1","author":"P. Frankl","year":"1981","unstructured":"P. Frankl andR. M. Wilson, Intersection theorems with geometric consequences,Combinatorica 1 (1981), 357\u2013368.","journal-title":"Combinatorica"},{"key":"BF02579389_CR4","first-page":"140","volume":"4","author":"H. Hadwiger","year":"1944","unstructured":"H. Hadwiger, \u00dcberdeckungss\u00e4tze f\u00fcr den Euklidischen Raum,Portugaliae Math. 4 (1944), 140\u2013144.","journal-title":"Portugaliae Math."},{"key":"BF02579389_CR5","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF02582929","volume":"1","author":"N. Ito","year":"1985","unstructured":"N. Ito, Hadamard graphs,Graphs and Combinatorics 1 (1985), 57\u201364.","journal-title":"Graphs and Combinatorics"},{"key":"BF02579389_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1112\/S0025579300004903","volume":"19","author":"D. G. Larman","year":"1972","unstructured":"D. G. Larman andC. A. Rogers, The realization of distances within sets in euclidean space,Mathematika 19 (1972), 1\u201324.","journal-title":"Mathematika"},{"key":"BF02579389_CR7","unstructured":"H. Enomoto, P. Frankl, N. Ito, andK. Nomura, Bounds on the size of code: with given distances,Graphs and Combinatorics, to appear."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579389.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02579389\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579389","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T16:45:03Z","timestamp":1558197903000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02579389"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,9]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1986,9]]}},"alternative-id":["BF02579389"],"URL":"https:\/\/doi.org\/10.1007\/bf02579389","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,9]]}}}