{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,4]],"date-time":"2024-07-04T00:12:26Z","timestamp":1720051946912},"reference-count":21,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1992,7,1]],"date-time":"1992-07-01T00:00:00Z","timestamp":709948800000},"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":7686,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1992,7]]},"DOI":"10.1016\/0166-218x(92)90154-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"501-510","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["The covering radius of Hadamard codes in odd graphs"],"prefix":"10.1016","volume":"37-38","author":[{"given":"Patrick","family":"Sol\u00e9","sequence":"first","affiliation":[]},{"given":"Arif","family":"Ghafoor","sequence":"additional","affiliation":[]},{"given":"Sohail A.","family":"Sheikh","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(92)90154-3_BIB1","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1109\/PGEC.1965.264176","article-title":"On the construction of (d,k)-graphs","volume":"14","author":"Akers","year":"1965","journal-title":"IEEE Trans. Electron. Comput."},{"key":"10.1016\/0166-218X(92)90154-3_BIB2","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1109\/TC.1981.1675777","article-title":"Analysis of chordal ring network","volume":"30","author":"Arden","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-218X(92)90154-3_BIB3","first-page":"581","article-title":"Fault diagnosis in a Boolean n-cube array of microprocessors","volume":"30","author":"Armstrong","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-218X(92)90154-3_BIB4","series-title":"Algebraic Combinatorics I: Association Schemes","author":"Bannai","year":"1984"},{"key":"10.1016\/0166-218X(92)90154-3_BIB5","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1109\/TIT.1972.1054732","article-title":"Weights distributions of the cosets of the (32,6) Reed-Muller code","volume":"18","author":"Berlekamp","year":"1972","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0166-218X(92)90154-3_BIB6","series-title":"Survey in Combinatorics","first-page":"1","article-title":"Graphs and interconnection networks: diameter and vulnerability","volume":"82","author":"Permond","year":"1983"},{"key":"10.1016\/0166-218X(92)90154-3_BIB7","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF01788663","article-title":"Large fault-tolerant interconnection networks","volume":"5","author":"Bermond","year":"1989","journal-title":"Graphs Combin."},{"key":"10.1016\/0166-218X(92)90154-3_BIB8","series-title":"Design Theory","author":"Beth","year":"1985"},{"key":"10.1016\/0166-218X(92)90154-3_BIB9","series-title":"Second International Conference on Combinatorial Mathematics","first-page":"71","article-title":"Some odd graph theory","volume":"319","author":"Biggs","year":"1979"},{"key":"10.1016\/0166-218X(92)90154-3_BIB10","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1109\/TIT.1985.1057043","article-title":"Covering radius-survey and recent results","volume":"31","author":"Cohen","year":"1985","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0166-218X(92)90154-3_BIB11","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/S0019-9958(73)80007-5","article-title":"Four fundamental parameters of a code","volume":"23","author":"Delsarte","year":"1973","journal-title":"Inform. and Control"},{"key":"10.1016\/0166-218X(92)90154-3_BIB12","series-title":"Tech. Rept. TR-85-4","article-title":"Some classes of fault-tolerant communication architecture for distributed systems","author":"Ghafoor","year":"1985"},{"key":"10.1016\/0166-218X(92)90154-3_BIB13","first-page":"176","article-title":"Distance-transitive graphs for fault-tolerant multiprocessor systems","author":"Ghafoor","year":"1989","journal-title":"Proceedings of the 18th International Conference on Parallel Processing I"},{"key":"10.1016\/0166-218X(92)90154-3_BIB14","series-title":"Tech. Rept. 32-761","article-title":"Hadamard matrices of order 20","author":"Hall","year":"1965"},{"key":"10.1016\/0166-218X(92)90154-3_BIB15","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0095-8956(75)90087-8","article-title":"Perfect codes in the graphs Ok","volume":"19","author":"Hammond","year":"1975","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0166-218X(92)90154-3_BIB16","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1109\/TIT.1978.1055928","article-title":"On the covering radius of binary codes","volume":"24","author":"Helleseth","year":"1978","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0166-218X(92)90154-3_BIB17","series-title":"The Theory of Error Correcting Codes","author":"MacWilliams","year":"1981"},{"key":"10.1016\/0166-218X(92)90154-3_BIB18","article-title":"On the enumeration of cosets of first order Reed-Muller codes","volume":"Vol. 7","author":"Sloane","year":"1971","journal-title":"IEEE International Conference on Communications"},{"key":"10.1016\/0166-218X(92)90154-3_BIB19","doi-asserted-by":"crossref","unstructured":"W.Wallis, A.P. Street and J. Seberry, Combinatorics: Room squares, sum-free sets, Hadamard matrices, in: Lecture Notes in Mathematics 292 (Springer, Berlin).","DOI":"10.1007\/BFb0069907"},{"key":"10.1016\/0166-218X(92)90154-3_BIB20","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0021-9800(70)80005-9","article-title":"Connectivity of transitive graphs","volume":"8","author":"Watkins","year":"1970","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0166-218X(92)90154-3_BIB21","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1109\/TC.1981.1675774","article-title":"Communication structures for large networks of microcomputers","volume":"30","author":"Wittie","year":"1981","journal-title":"IEEE Trans. Comput."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X92901543?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X92901543?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:23:19Z","timestamp":1555136599000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X92901543"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,7]]},"references-count":21,"alternative-id":["0166218X92901543"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(92)90154-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1992,7]]}}}