{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:58:42Z","timestamp":1725663522896},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540510833"},{"type":"electronic","value":"9783540461524"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51083-4_75","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:41:25Z","timestamp":1330202485000},"page":"396-406","source":"Crossref","is-referenced-by-count":0,"title":["A covering problem in the odd graphs"],"prefix":"10.1007","author":[{"given":"Patrick","family":"Sol\u00e9","sequence":"first","affiliation":[]},{"given":"Arif","family":"Ghafoor","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"33_CR1","unstructured":"E. Bannai, T. Ito. Algebraic Combinatorics I: Association Schemes. Benjamin-Cummings (1984)."},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"E.R. Berlekamp, L.R. Welch. \u201cWeights distributions of the cosets of the (32, 6) Reed-Muller code.\u201d IEEE Trans. on Inf. Theory, IT-18,1,Jan.(1972).","DOI":"10.1109\/TIT.1972.1054732"},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"N.L. Biggs, \u201cSome Odd Graph Theory\u201d, in Second International Conference on Combinatorial Mathematics, Annals of the New York Academy of Science Vol. 319, 1979. pp. 71\u201385.","DOI":"10.1111\/j.1749-6632.1979.tb32775.x"},{"issue":"3","key":"33_CR4","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1109\/TIT.1985.1057043","volume":"IT-31","author":"G. Cohen","year":"1985","unstructured":"G. Cohen, M.G. Karpovsky, H.F. Mattson, J.R. Schatz, \u201cCovering Radius-Survey and Recent Results\u201d, IEEE Trans. on Inf. Theory, IT-31,3, (1985), p.328.","journal-title":"IEEE Trans. on Inf. Theory"},{"key":"33_CR5","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/S0019-9958(73)80007-5","volume":"23","author":"P. Delsarte","year":"1973","unstructured":"P. Delsarte, \u201cFour Fundamental Parameters of a Code\u201d, Inf. and Contr., 23, pp. 407\u2013438, (1973).","journal-title":"Inf. and Contr."},{"key":"33_CR6","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0095-8956(75)90087-8","volume":"19","author":"P. Hammond","year":"1975","unstructured":"P. Hammond, D.H. Smith, \u201cPerfect codes in the graphs O k .\u201d Journ. of Comb. Theory, Ser. B, 19 (1975), p. 239\u2013255.","journal-title":"Journ. of Comb. Theory, Ser. B"},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"T. Helleseth, T. Klove, J. Mykkelveit. \u201cOn the covering radius of binary codes.\u201d IEEE Trans. on Inf. Theory, IT,24,5,Sept.(1978).","DOI":"10.1109\/TIT.1978.1055928"},{"key":"33_CR8","unstructured":"F.J. MacWilliams, N.J.A. Sloane The theory of error correcting codes. North Holland (1981)."},{"key":"33_CR9","unstructured":"N.J.A. Sloane, R.J. Dick. \u201cOn the enumeration of cosets of first order Reed-Muller codes.\u201d IEEE Int. Conf. on Comm., Montreal June 1971, vol. 7."},{"issue":"4","key":"33_CR10","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1109\/TC.1981.1675774","volume":"C-30","author":"L.D. Wittie","year":"1981","unstructured":"L.D. Wittie, \u201cCommunication Structures for large networks of microcomputers\u201d, IEEE Trans. on Compu., Vol. C-30(4), April 1981. pp. 264\u2013273.","journal-title":"IEEE Trans. on Compu."},{"key":"33_CR11","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1109\/TC.1981.1675844","volume":"C-30","author":"J.R. Armstrong","year":"1981","unstructured":"J.R. Armstrong and F.G. Gray, \u201cFault diagnosis in a Boolean n-cube array of microprocessors,\u201d IEEE Trans. on Compu., Vol. C-30, pp. 581\u2013590, Aug. 1981.","journal-title":"IEEE Trans. on Compu."},{"issue":"4","key":"33_CR12","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1109\/TC.1981.1675777","volume":"C-30","author":"B.W. Arden","year":"1981","unstructured":"B.W. Arden and H. Lee, \u201cAnalysis of Chordal Ring Network\u201d, IEEE Trans. on Compu. Vol. C-30(4), April 1981. pp. 291\u2013295.","journal-title":"IEEE Trans. on Compu."},{"key":"33_CR13","unstructured":"A. Ghafoor, \u201cSome classes of fault-tolerant communication architecture for distributed systems\u201d, Tech. Rep. TR-85-4, Dept. of Elect. and Comp. Engr. Syracuse University, 1985."},{"key":"33_CR14","unstructured":"A. Ghafoor, T.R. Bashkow, and I. Ghafoor, \u201cFault-tolerance and Diagnosability of a class of Binomial interconnection networks\u201d, Proc. of AFIPS, vol. 55, NCC, 1986."},{"key":"33_CR15","volume-title":"Design Theory","author":"T. Beth","year":"1985","unstructured":"T. Beth, D. Lenz, M. Jungnickel, Design Theory, BI Institute, Mannheim, (1985)."}],"container-title":["Lecture Notes in Computer Science","Applied Algebra, Algebraic Algorithms and Error-Correcting Codes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51083-4_75.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:19:46Z","timestamp":1605647986000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51083-4_75"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540510833","9783540461524"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-51083-4_75","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}