{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T04:35:59Z","timestamp":1719894959540},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1985,9,1]],"date-time":"1985-09-01T00:00:00Z","timestamp":494380800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,9,13]],"date-time":"2013-09-13T00:00:00Z","timestamp":1379030400000},"content-version":"vor","delay-in-days":10239,"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":[[1985,9]]},"DOI":"10.1016\/s0195-6698(85)80039-1","type":"journal-article","created":{"date-parts":[[2013,9,13]],"date-time":"2013-09-13T08:33:48Z","timestamp":1379061228000},"page":"279-285","source":"Crossref","is-referenced-by-count":19,"title":["On the Nonbinary Johnson Scheme"],"prefix":"10.1016","volume":"6","author":[{"given":"Hannu","family":"Tarnanen","sequence":"first","affiliation":[]},{"given":"Matti J.","family":"Aaltonen","sequence":"additional","affiliation":[]},{"given":"Jean-Marie","family":"Goethals","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0195-6698(85)80039-1_bib1","article-title":"Bounds on the information rate of a tree code as a function of the code's feedback decoding minimum distance","volume":"I 181","author":"Aaltonen","year":"1981","journal-title":"Ann. Univ. Turku, Ser. A"},{"key":"10.1016\/S0195-6698(85)80039-1_bib2","unstructured":"E. Bannai, T. Ito: Algebraic Combinatorias: Part I, Benjamin\/ Cummings, New York, to appear."},{"key":"10.1016\/S0195-6698(85)80039-1_bib3","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(85)80039-1_bib4","article-title":"An algebraic approach to the association schemes of coding theory","volume":"10","author":"Delsarte","year":"1973","journal-title":"Philips Research Reports Supplements"},{"key":"10.1016\/S0195-6698(85)80039-1_bib5","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1512\/iumj.1976.25.25030","article-title":"A Krawtchouk polynomial addition theorem and wreath products of symmetric groups","volume":"25","author":"Dunkl","year":"1976","journal-title":"Indiana Univ. Math. J."},{"key":"10.1016\/S0195-6698(85)80039-1_bib6","series-title":"The Theory of Error-Correcting Codes","author":"MacWilliams","year":"1977"},{"key":"10.1016\/S0195-6698(85)80039-1_bib7","series-title":"Combinatorial Identities","author":"Riordan","year":"1968"}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669885800391?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669885800391?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,12]],"date-time":"2018-10-12T23:56:26Z","timestamp":1539388586000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669885800391"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,9]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1985,9]]}},"alternative-id":["S0195669885800391"],"URL":"https:\/\/doi.org\/10.1016\/s0195-6698(85)80039-1","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[1985,9]]}}}