{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T13:20:35Z","timestamp":1648905635997},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,9,10]],"date-time":"2013-09-10T00:00:00Z","timestamp":1378771200000},"content-version":"vor","delay-in-days":10114,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[1986,1]]},"DOI":"10.1016\/s0195-6698(86)80015-4","type":"journal-article","created":{"date-parts":[[2013,9,9]],"date-time":"2013-09-09T12:45:44Z","timestamp":1378730744000},"page":"27-41","source":"Crossref","is-referenced-by-count":4,"title":["Upper Bounds for the Cardinality of s-Distances Codes"],"prefix":"10.1016","volume":"7","author":[{"given":"Monique","family":"Laurent","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0195-6698(86)80015-4_bib1","series-title":"Ph.D thesis","article-title":"Few distances sets","author":"Blokhuis","year":"1973"},{"key":"10.1016\/S0195-6698(86)80015-4_bib2","series-title":"Ph.D thesis","article-title":"A contribution to the non-existence of perfect codes","author":"Best","year":"1982"},{"key":"10.1016\/S0195-6698(86)80015-4_bib3","first-page":"35","article-title":"Codes parfaits et uniformement empiles","volume":"49","author":"Cohen","year":"1976","journal-title":"Revue du Cethedec"},{"key":"10.1016\/S0195-6698(86)80015-4_bib4","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/S0019-9958(73)80007-5","article-title":"Four fundamental parameters of a code and their combinatorial significance","volume":"23","author":"Delsarte","year":"1973","journal-title":"Information and Control"},{"key":"10.1016\/S0195-6698(86)80015-4_bib5","first-page":"272","article-title":"Bounds for unrestricted codes by linear programming","volume":"27","author":"Delsarte","year":"1972","journal-title":"Philips Research Reports"},{"key":"10.1016\/S0195-6698(86)80015-4_bib6","doi-asserted-by":"crossref","unstructured":"M. Deza and P. Frankl, On squashed designs, Discrete and Computational Geometry (to appear).","DOI":"10.1007\/BF02187709"},{"key":"10.1016\/S0195-6698(86)80015-4_bib7","unstructured":"P. Frankl, Bounding the size of a family knowing the cardinality of differences, Studia Sci. Hung. (to appear)."},{"key":"10.1016\/S0195-6698(86)80015-4_bib8","first-page":"687","article-title":"On the nonexistence of unknown perfect 6- and 8-codes in Hamming schemes H(n, q) with q arbitrary","volume":"21","author":"Hong","year":"1984","journal-title":"Osaka J. Math."},{"key":"10.1016\/S0195-6698(86)80015-4_bib9","series-title":"Ph.D thesis","article-title":"Some nonexistence theorems for perfect codes over arbitrary alphabets","author":"Reuvers","year":"1977"},{"key":"10.1016\/S0195-6698(86)80015-4_bib10","series-title":"The Theory of Error Correcting Codes","author":"MacWilliams","year":"1977"},{"key":"10.1016\/S0195-6698(86)80015-4_bib11","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1137\/0124010","article-title":"On the nonexistence of perfect codes over finite fields","volume":"24","author":"Tietavainen","year":"1973","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0195-6698(86)80015-4_bib12","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0012-365X(77)90152-2","article-title":"Nonexistence of nontrivial perfect codes in case q= p1sp2t, e \u2a7e 3","volume":"17","author":"Tietavainen","year":"1977","journal-title":"Discrete Math."},{"key":"10.1016\/S0195-6698(86)80015-4_bib13","series-title":"Matroid Theory","author":"Welsh","year":"1976"},{"key":"10.1016\/S0195-6698(86)80015-4_bib14","series-title":"The nonexistence of perfect codes over Galois fields","author":"Zinoviev","year":"1972"}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669886800154?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669886800154?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,13]],"date-time":"2018-10-13T08:22:23Z","timestamp":1539418943000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669886800154"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,1]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1986,1]]}},"alternative-id":["S0195669886800154"],"URL":"https:\/\/doi.org\/10.1016\/s0195-6698(86)80015-4","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[1986,1]]}}}