{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T01:00:16Z","timestamp":1648688416585},"reference-count":5,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,4,1]],"date-time":"1996-04-01T00:00:00Z","timestamp":828316800000},"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":6316,"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":[[1996,4]]},"DOI":"10.1016\/0012-365x(95)00213-g","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:55:41Z","timestamp":1052769341000},"page":"441-447","source":"Crossref","is-referenced-by-count":2,"title":["On product of association schemes and Shannon capacity"],"prefix":"10.1016","volume":"150","author":[{"given":"Dezs\u0151","family":"Mikl\u00f3s","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(95)00213-G_BIB1","article-title":"An algebraic approach to the association schemes in coding theory","volume":"10","author":"Delsarte","year":"1973","journal-title":"Philips Res. Reps. Suppl."},{"key":"10.1016\/0012-365X(95)00213-G_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","article-title":"On the Shannon capacity of a graph","volume":"25","author":"Lov\u00e1sz","year":"1979","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0012-365X(95)00213-G_BIB3","first-page":"134","article-title":"The Lov\u00e1sz bound and some generalizations","volume":"3","author":"McEliece","year":"1978","journal-title":"J. Combin. Inform. System Sci."},{"key":"10.1016\/0012-365X(95)00213-G_BIB4","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1109\/TIT.1979.1056072","article-title":"A comparision of the Delsarte and Lov\u00e1sz bounds","volume":"25","author":"Schrijver","year":"1979","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0012-365X(95)00213-G_BIB5","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1109\/TIT.1956.1056774","article-title":"The zero-error capacity of a noisy channel","volume":"3","author":"Shannon","year":"1956","journal-title":"IRE Trans. Inform. Theory"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9500213G?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9500213G?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T14:23:06Z","timestamp":1556115786000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9500213G"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,4]]},"references-count":5,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,4]]}},"alternative-id":["0012365X9500213G"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(95)00213-g","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,4]]}}}