{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T19:05:44Z","timestamp":1754161544198,"version":"3.41.2"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Designs, Codes and Cryptography"],"published-print":{"date-parts":[[1998,12]]},"DOI":"10.1023\/a:1008364924033","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T09:41:38Z","timestamp":1040550098000},"page":"237-243","source":"Crossref","is-referenced-by-count":1,"title":["On Lower Bounds For Covering Codes"],"prefix":"10.1007","volume":"15","author":[{"given":"M. C.","family":"Bhandari","sequence":"first","affiliation":[]},{"given":"K. K. P.","family":"Chanduka","sequence":"additional","affiliation":[]},{"given":"A. K.","family":"Lal","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"185601_CR1","unstructured":"G. Cohen, I. S. Honkala, S. Litsyn, and A. Lobstein, Covering Codes, Elsevier (1997)."},{"key":"185601_CR2","doi-asserted-by":"crossref","first-page":"1122","DOI":"10.1109\/18.335963","volume":"40","author":"L. Dongfeng","year":"1994","unstructured":"L. Dongfeng and W. Chen, New lower bounds for binary covering codes, IEEE Trans. Inform. Theory, Vol. 40 (1994) pp. 1122-1129.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"185601_CR3","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BF01388486","volume":"3","author":"H. O. H\u00e4m\u00e4l\u00e4inen","year":"1993","unstructured":"H. O. H\u00e4m\u00e4l\u00e4inen, I. S. Honkala, M. K. Kaikkonen, and S. N. Litsyn, Bounds for binary multiple covering codes, Designs, Codes and Cryptography, Vol. 3 (1993) pp. 251-275.","journal-title":"Designs, Codes and Cryptography"},{"key":"185601_CR4","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1109\/18.2644","volume":"34","author":"I. S. Honkala","year":"1988","unstructured":"I. S. Honkala, Lower bounds for binary covering codes, IEEE Trans. Inform. Theory, Vol. 34 (1988) pp. 326-329.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"185601_CR5","first-page":"361","volume":"37","author":"I. S. Honkala","year":"1991","unstructured":"I. S. Honkala, Modified bounds for covering codes, IEEE Trans. Inform. Theory, Vol. 37 (1991) pp. 361-65.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"185601_CR6","doi-asserted-by":"crossref","first-page":"895","DOI":"10.1109\/18.53754","volume":"36","author":"X. Hou","year":"1990","unstructured":"X. Hou, New lower bounds for covering codes, IEEE Trans. Inform. Theory, Vol. 36 (1990) pp. 895-99.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"185601_CR7","doi-asserted-by":"crossref","first-page":"1476","DOI":"10.1109\/18.59951","volume":"36","author":"X. Hou","year":"1990","unstructured":"X. Hou, An improved sphere bounds for covering codes with n = 3R + 2, IEEE Trans. Inform. Theory, Vol. 36 (1990) pp. 1476-1478.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"185601_CR8","first-page":"121","volume":"1","author":"S. M. Johnson","year":"1972","unstructured":"S. M. Johnson, A new lower for coverings by rook domains, Utilitas Mathematica, Vol. 1 (1972) pp. 121-40.","journal-title":"Utilitas Mathematica"},{"key":"185601_CR9","volume-title":"The Theory of Error-Correcting Codes","author":"F. J. MacWilliams","year":"1976","unstructured":"F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, 2nd. edition, North-Holland, Amsterdam (1976).","edition":"2nd. edition"},{"key":"185601_CR10","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1109\/18.61135","volume":"37","author":"P. R. J. \u00d6sterg\u00e5rd","year":"1991","unstructured":"P. R. J. \u00d6sterg\u00e5rd, A new binary code of length 10 and covering radius 1, IEEE Trans. Inform. Theory, Vol. 37 (1991) pp. 179-180.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"185601_CR11","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1023\/A:1008228721072","volume":"11","author":"P. R. J. \u00d6sterg\u00e5rd","year":"1997","unstructured":"P. R. J. \u00d6sterg\u00e5rd and H. O. H\u00e4m\u00e4l\u00e4inen, New upper bounds for binary=ternary mixed covering codes, Designs, Codes and Cryptography, Vol. 11 (1997) pp. 151-178.","journal-title":"Designs, Codes and Cryptography"},{"key":"185601_CR12","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1109\/18.2632","volume":"34","author":"G. J. M. van Wee","year":"1988","unstructured":"G. J. M. van Wee, Improved sphere bounds on the covering radius of codes, IEEE Trans. Inform. Theory, Vol. 34 (1988) pp. 237-245.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"185601_CR13","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1109\/18.79914","volume":"37","author":"Z. Zhang","year":"1991","unstructured":"Z. Zhang, Linear inequality for covering codes: Part I-pair covering inequalities, IEEE Trans. Inform. Theory, Vol. 37 (1991) pp. 573-582.","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008364924033.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008364924033\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008364924033.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T02:29:12Z","timestamp":1753756152000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008364924033"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,12]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,12]]}},"alternative-id":["185601"],"URL":"https:\/\/doi.org\/10.1023\/a:1008364924033","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[1998,12]]}}}