{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:26:40Z","timestamp":1757626000305,"version":"3.44.0"},"reference-count":21,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1991,11,1]],"date-time":"1991-11-01T00:00:00Z","timestamp":688953600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1991,11,1]],"date-time":"1991-11-01T00:00:00Z","timestamp":688953600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2004,4,8]],"date-time":"2004-04-08T00:00:00Z","timestamp":1081382400000},"content-version":"vor","delay-in-days":4542,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1991,11]]},"DOI":"10.1016\/0166-218x(91)90117-f","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:01Z","timestamp":1027640581000},"page":"215-224","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["The covering radius of doubled 2-designs in 2 O"],"prefix":"10.1016","volume":"33","author":[{"given":"Patrick","family":"Sol\u00e9","sequence":"first","affiliation":[]},{"given":"Arif","family":"Ghafoor","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(91)90117-F_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. Electr. Comput."},{"key":"10.1016\/0166-218X(91)90117-F_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(91)90117-F_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."},{"year":"1984","series-title":"Algebraic Combinatorics I: Association Schemes","author":"Bannai","key":"10.1016\/0166-218X(91)90117-F_bib4"},{"year":"1973","series-title":"Graphs and Hypergraphs","author":"Berge","key":"10.1016\/0166-218X(91)90117-F_bib5"},{"key":"10.1016\/0166-218X(91)90117-F_bib6","series-title":"Survey in Combinatorics","article-title":"Graphs and interconnection networks: diameter and vulnerability","volume":"82","author":"Bermond","year":"1983"},{"key":"10.1016\/0166-218X(91)90117-F_bib7","article-title":"Large fault-tolerant interconnection networks","author":"Bermond","year":"1986","journal-title":"Proceedings First Japan Conference on Graph Theory and Applications"},{"year":"1985","series-title":"Design theory","author":"Beth","key":"10.1016\/0166-218X(91)90117-F_bib8"},{"issue":"2","key":"10.1016\/0166-218X(91)90117-F_bib9","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1093\/qmath\/26.1.113","article-title":"Designs, factors and codes in graphs","volume":"26","author":"Biggs","year":"1975","journal-title":"Quart. J. Math. Oxford Ser."},{"key":"10.1016\/0166-218X(91)90117-F_bib10","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(91)90117-F_bib11","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(91)90117-F_bib12","article-title":"An algebraic approach to the association schemes of coding theory","volume":"10","author":"Delsarte","year":"1973","journal-title":"Philips Res. Repts."},{"key":"10.1016\/0166-218X(91)90117-F_bib13","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1109\/12.73594","article-title":"A study of odd graphs as fault-tolerant interconnection networks","volume":"40","author":"Ghafoor","year":"1991","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-218X(91)90117-F_bib14","first-page":"176","article-title":"Distance-transitive graphs for fault-tolerant multiprocessor systems","volume":"I","author":"Ghafoor","year":"1989","journal-title":"Proceedings of the 1989 International Conference on Parallel Processing"},{"key":"10.1016\/0166-218X(91)90117-F_bib15","first-page":"173","article-title":"A bipartite distance-regular topology for fault-tolerant multiprocessor systems","volume":"137","author":"Ghafoor","year":"1990","journal-title":"Proceedings of IEE E"},{"year":"1967","series-title":"Combinatorial Theory","author":"Hall","key":"10.1016\/0166-218X(91)90117-F_bib16"},{"key":"10.1016\/0166-218X(91)90117-F_bib17","doi-asserted-by":"crossref","first-page":"702","DOI":"10.4153\/CJM-1963-069-5","article-title":"On some tactical configurations","volume":"15","author":"Hanani","year":"1963","journal-title":"Canad. J. Math."},{"key":"10.1016\/0166-218X(91)90117-F_bib18","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"},{"year":"1981","series-title":"The Theory of Error-Correcting Codes","author":"MacWilliams","key":"10.1016\/0166-218X(91)90117-F_bib19"},{"key":"10.1016\/0166-218X(91)90117-F_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(91)90117-F_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:0166218X9190117F?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9190117F?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T20:52:53Z","timestamp":1757451173000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9190117F"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,11]]},"references-count":21,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1991,11]]}},"alternative-id":["0166218X9190117F"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(91)90117-f","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[1991,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The covering radius of doubled 2-designs in 2 Ok","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0166-218X(91)90117-F","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1991 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}