{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T06:21:34Z","timestamp":1729664494759,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1109\/isit.2005.1523472","type":"proceedings-article","created":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T15:51:59Z","timestamp":1160581919000},"page":"921-925","source":"Crossref","is-referenced-by-count":0,"title":["New upper bounds on A(n, d)"],"prefix":"10.1109","author":[{"given":"B.","family":"Mounits","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Etzion","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Litsyn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"year":"1977","author":"macwilliams","journal-title":"The Theory of Error-Correcting Codes","key":"ref10"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1109\/18.992776"},{"year":"1982","author":"van pul","article-title":"On bounds on codes","key":"ref12"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1016\/0012-365X(82)90126-1"},{"key":"ref14","article-title":"New code upper bounds from the Terwilliger algebra","author":"schrijver","year":"2004","journal-title":"Preprint"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1016\/0012-365X(77)90158-3"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1109\/TIT.1980.1056269"},{"key":"ref6","article-title":"An algebraic approach to the association schemes of coding theory","author":"delsarte","year":"1973","journal-title":"Philips Research Reports Supplements"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1109\/TIT.1978.1055827"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/TIT.1962.1057714"},{"year":"1987","author":"honkala","article-title":"Bounds for binary constant weight and covering codes","key":"ref7"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1109\/18.959279"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"2373","DOI":"10.1109\/18.887851","article-title":"Upper bounds for constant-weight codes","volume":"46","author":"agrell","year":"2000","journal-title":"IEEE Trans on Inform Theory"},{"key":"ref9","first-page":"463","article-title":"An updated table of the best binary codes known","volume":"1","author":"litsyn","year":"1998","journal-title":"Handbook of Coding Theory"}],"event":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","start":{"date-parts":[[2005,9,4]]},"location":"Adelaide, Australia","end":{"date-parts":[[2005,9,9]]}},"container-title":["Proceedings. International Symposium on Information Theory, 2005. ISIT 2005."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10215\/32581\/01523472.pdf?arnumber=1523472","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,17]],"date-time":"2017-06-17T10:08:28Z","timestamp":1497694108000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1523472\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isit.2005.1523472","relation":{},"subject":[],"published":{"date-parts":[[2005]]}}}