{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:33:36Z","timestamp":1759847616632},"reference-count":15,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1971,11,1]],"date-time":"1971-11-01T00:00:00Z","timestamp":57801600000},"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":15234,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series A"],"published-print":{"date-parts":[[1971,11]]},"DOI":"10.1016\/0097-3165(71)90051-3","type":"journal-article","created":{"date-parts":[[2004,10,5]],"date-time":"2004-10-05T11:09:06Z","timestamp":1096974546000},"page":"233-250","source":"Crossref","is-referenced-by-count":25,"title":["On covering sets and error-correcting codes"],"prefix":"10.1016","volume":"11","author":[{"given":"J.G","family":"Kalbfleisch","sequence":"first","affiliation":[]},{"given":"R.G","family":"Stanton","sequence":"additional","affiliation":[]},{"given":"J.D","family":"Horton","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0097-3165(71)90051-3_BIB1","volume":"Vol. 1","author":"Feller","year":"1968"},{"key":"10.1016\/0097-3165(71)90051-3_BIB2","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1109\/TIT.1964.1053680","article-title":"Rook domains, Latin squares, affine planes, and error-distributing codes","volume":"10","author":"Golomb","year":"1964","journal-title":"IEEE Trans. Information Theory"},{"key":"10.1016\/0097-3165(71)90051-3_BIB3","article-title":"Some Improved Bounds on Covering Sets","author":"Horton","year":"1968"},{"key":"10.1016\/0097-3165(71)90051-3_BIB4","first-page":"40","article-title":"A combinatorial problem in matching","volume":"44","author":"Kalbfleisch","year":"1969","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0097-3165(71)90051-3_BIB5","series-title":"Recent Progress in Combinatorics","article-title":"Some new results for the covering problem","author":"Kalbfleisch","year":"1969"},{"key":"10.1016\/0097-3165(71)90051-3_BIB6","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/S0021-9800(67)80102-9","article-title":"The football pool problem for five Mathces","volume":"3","author":"Kamps","year":"1967","journal-title":"J. Combinatorial Theory"},{"key":"10.1016\/0097-3165(71)90051-3_BIB7","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1002\/j.1538-7305.1957.tb02410.x","article-title":"Binary block coding","volume":"36","author":"Lloyd","year":"1957","journal-title":"Bell Systems Tech. J."},{"key":"10.1016\/0097-3165(71)90051-3_BIB8","doi-asserted-by":"crossref","unstructured":"G. O. Losey, Note on a theorem of Zaremba (to appear, J. Combinatorial Theory).","DOI":"10.1016\/S0021-9800(69)80122-5"},{"key":"10.1016\/0097-3165(71)90051-3_BIB9","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1147\/rd.31.0025","article-title":"On the mathematical theory of error-correcting codes","volume":"3","author":"Shapiro","year":"1959","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/0097-3165(71)90051-3_BIB10","series-title":"Recent Progress in Combinatorics","article-title":"Covering theorems in groups","author":"Stanton","year":"1969"},{"key":"10.1016\/0097-3165(71)90051-3_BIB11","unstructured":"R. G. Stanton, J. D. Horton, and J. G. Kalbfleisch, Covering theorems in groups with special reference to the case of four and five components (to appear, J. London Math. Soc.)."},{"key":"10.1016\/0097-3165(71)90051-3_BIB12","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/BF01817562","article-title":"Covering problems for dichotomized matchings","volume":"1","author":"Stanton","year":"1968","journal-title":"Aequationes Math."},{"key":"10.1016\/0097-3165(71)90051-3_BIB13","doi-asserted-by":"crossref","unstructured":"R. G. Stanton and J. G. Kalbfleisch, Intersection inequalities for the covering problem (to appear, SIAM J. Appl. Math.).","DOI":"10.1137\/0117123"},{"key":"10.1016\/0097-3165(71)90051-3_BIB14","first-page":"303","article-title":"Covering theorems for groups","volume":"21","author":"Taussky","year":"1948","journal-title":"Ann. Soc. Polon. Math."},{"key":"10.1016\/0097-3165(71)90051-3_BIB15","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1112\/jlms\/s1-27.2.242","article-title":"Covering problems concerning Abelian groups","volume":"27","author":"Zaremba","year":"1952","journal-title":"J. London Math. Soc."}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316571900513?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316571900513?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T02:32:18Z","timestamp":1549161138000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0097316571900513"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1971,11]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1971,11]]}},"alternative-id":["0097316571900513"],"URL":"https:\/\/doi.org\/10.1016\/0097-3165(71)90051-3","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[1971,11]]}}}