{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T12:12:51Z","timestamp":1773231171682,"version":"3.50.1"},"reference-count":15,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"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":8963,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1989]]},"DOI":"10.1016\/0012-365x(89)90141-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:43Z","timestamp":1027640623000},"page":"263-290","source":"Crossref","is-referenced-by-count":20,"title":["The solution to Berlekamp's switching game"],"prefix":"10.1016","volume":"74","author":[{"given":"P.C.","family":"Fishburn","sequence":"first","affiliation":[]},{"given":"N.J.A.","family":"Sloane","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(89)90141-6_bib1","doi-asserted-by":"crossref","first-page":"700","DOI":"10.1109\/TIT.1986.1057229","article-title":"Subcodes and covering radius","volume":"IT-32","author":"Adams","year":"1986","journal-title":"IEEE Trans. Information Theory"},{"key":"10.1016\/0012-365X(89)90141-6_bib2","doi-asserted-by":"crossref","first-page":"165","DOI":"10.4064\/cm-23-1-165-171","article-title":"Minimization of \u00b11 matrices under line shifts","volume":"23","author":"Brown","year":"1971","journal-title":"Colloq. Math."},{"key":"10.1016\/0012-365X(89)90141-6_bib3","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1109\/TIT.1985.1057043","article-title":"Covering radius\u2014survey and recent results","volume":"IT-31","author":"Cohen","year":"1985","journal-title":"IEEE Trans. Information Theory"},{"key":"10.1016\/0012-365X(89)90141-6_bib4","doi-asserted-by":"crossref","first-page":"680","DOI":"10.1109\/TIT.1986.1057227","article-title":"Further results on the covering radius of codes","volume":"IT-32","author":"Cohen","year":"1986","journal-title":"IEEE Trans. Information Theory"},{"key":"10.1016\/0012-365X(89)90141-6_bib5","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1109\/TIT.1985.1057033","article-title":"The covering radius of cyclic codes of length up to 31","volume":"IT-31","author":"Downie","year":"1985","journal-title":"IEEE Trans. Information Theory"},{"key":"10.1016\/0012-365X(89)90141-6_bib6","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/BF02762622","article-title":"On extensions of the Gale-Berlekamp switching problem and constant of lp-spaces","volume":"11","author":"Gordon","year":"1972","journal-title":"Israel J. Math."},{"key":"10.1016\/0012-365X(89)90141-6_bib7","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1109\/TIT.1985.1057039","article-title":"On the covering radius of codes","volume":"IT-31","author":"Graham","year":"1985","journal-title":"IEEE Trans. Information Theory"},{"key":"10.1016\/0012-365X(89)90141-6_bib8","doi-asserted-by":"crossref","unstructured":"I. Honkala, Lower bounds for binary covering codes, IEEE Trans. Information Theory, to appear.","DOI":"10.1109\/18.2644"},{"key":"10.1016\/0012-365X(89)90141-6_bib9","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1137\/0608049","article-title":"On the covering radius problem for codes: (I) bounds on normalized covering radius","volume":"8","author":"Kilby","year":"1987","journal-title":"SIAM J. Algeb. Discrete Methods"},{"key":"10.1016\/0012-365X(89)90141-6_bib10","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1137\/0608050","article-title":"On the covering radius problem for codes: (II) codes of low dimension; normal and abnormal codes","volume":"8","author":"Kilby","year":"1987","journal-title":"SIAM J. Algeb. Discrete Methods"},{"key":"10.1016\/0012-365X(89)90141-6_bib11","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/3-540-16767-6_53","article-title":"An improved upper bound on covering radius","volume":"228","author":"Mattson","year":"1986","journal-title":"Lect. Notes Computer Science"},{"key":"10.1016\/0012-365X(89)90141-6_bib12","unstructured":"J. Pach and J. Spencer, Explicit codes with low covering radius, preprint."},{"key":"10.1016\/0012-365X(89)90141-6_bib13","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0097-3165(86)90007-5","article-title":"A new approach to the covering radius of codes","volume":"A 42","author":"Sloane","year":"1986","journal-title":"J. Combinatorial Theory"},{"key":"10.1016\/0012-365X(89)90141-6_bib14","series-title":"Open Problems in Communication and Computation","first-page":"51","article-title":"Unsolved problems related to the covering radius of codes","author":"Sloane","year":"1987"},{"key":"10.1016\/0012-365X(89)90141-6_bib15","doi-asserted-by":"crossref","unstructured":"G.J.M. van Wee, Improved sphere bounds on the covering radius of codes, IEEE Trans. Information Theory, to appear.","DOI":"10.1109\/18.2632"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X89901416?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X89901416?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:50:35Z","timestamp":1555120235000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X89901416"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989]]}},"alternative-id":["0012365X89901416"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(89)90141-6","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1989]]}}}