{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:11:21Z","timestamp":1725459081252},"publisher-location":"Berlin\/Heidelberg","reference-count":3,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540516433"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0019871","type":"book-chapter","created":{"date-parts":[[2006,1,12]],"date-time":"2006-01-12T11:48:27Z","timestamp":1137066507000},"page":"328-328","source":"Crossref","is-referenced-by-count":0,"title":["Open problem 1: Covering radius of the circuit code"],"prefix":"10.1007","author":[{"given":"Patrick","family":"Sol\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","unstructured":"C. Berge, \u201cGraphes et Hypergraphes,\u201d Dunod (1984)."},{"key":"30_CR2","unstructured":"A. McLoughlin, \u201cThe complexity of the covering radius,\u201d IEEE Tr. on Inf. Th., (Nov. 1984.)"},{"key":"30_CR3","unstructured":"D. J. Walsh, \u201cMatroid Theory,\u201d Academic Press (1988)."}],"container-title":["Lecture Notes in Computer Science","Coding Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0019871.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:43:31Z","timestamp":1607550211000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0019871"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540516433"],"references-count":3,"URL":"https:\/\/doi.org\/10.1007\/bfb0019871","relation":{},"subject":[]}}