{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:59:50Z","timestamp":1772283590491,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1999,12,1]],"date-time":"1999-12-01T00:00:00Z","timestamp":944006400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,12,1]],"date-time":"1999-12-01T00:00:00Z","timestamp":944006400000},"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":[[1999,12]]},"DOI":"10.1023\/a:1008397405457","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T09:41:38Z","timestamp":1040550098000},"page":"163-181","source":"Crossref","is-referenced-by-count":3,"title":["Some Upper Bounds on the Covering Radii of Linear Codes Over Fq and Their Applications"],"prefix":"10.1007","volume":"18","author":[{"given":"H.","family":"Janwa","sequence":"first","affiliation":[]},{"suffix":"Jr.","given":"H. F.","family":"Mattson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"240918_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0166-218X(91)90104-5","volume":"33","author":"M. C. Bhandari","year":"1991","unstructured":"M. C. Bhandari and M. S. Garg, A note on the covering radius of optimum codes, Discrete Applied Mathematics, Vol. 33 (1991) pp. 3-9.","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"240918_CR2","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1109\/18.212301","volume":"39","author":"A. E. Brouwer","year":"1993","unstructured":"A. E. Brouwer and T. Verhoeff, An updated table of minimum-distance bounds for binary linear codes, IEEE Trans. Inform. Theory, Vol. 39,No. 2 (1993) pp. 662-677.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"240918_CR3","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1109\/18.42181","volume":"IT-35","author":"R. Brualdi","year":"1989","unstructured":"R. Brualdi, V. Pless, and R. M. Wilson, Short codes with a given covering radius, IEEE Trans. Inform. Theory,, Vol. IT-35 (1989) pp. 99-109.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"240918_CR4","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1109\/TIT.1985.1057073","volume":"IT-31","author":"P. B. Busschbach","year":"1985","unstructured":"P. B. Busschbach, M. G. L. Gerretzen, and H. C. A. van Tilborg, On the covering radius of codes meeting the Griesmer bound, IEEE Trans.-Inform. Theory, Vol. IT-31 (1985) pp. 465-468.","journal-title":"IEEE Trans.-Inform. Theory"},{"key":"240918_CR5","doi-asserted-by":"crossref","unstructured":"G. D. Cohen, S. N. Litsyn, A. C. Lobstein, and H. F. Mattson, Jr., Covering Radius 1985\u20131994, AAECC (Springer), Vol. 8 (1997) pp. 173-239.","DOI":"10.1007\/s002000050061"},{"key":"240918_CR6","volume-title":"Covering Codes","author":"G. D. Cohen","year":"1997","unstructured":"G. D. Cohen, I. Honkala, S. N. Litsyn, and A. C. Lobstein, Covering Codes, North Holland Mathematical Library, Amsterdam (1997)."},{"key":"240918_CR7","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1109\/TIT.1985.1057043","volume":"IT-31","author":"G. D. Cohen","year":"1985","unstructured":"G. D. Cohen, M. G. Karpovsky, H. F. Mattson, Jr., and J. R. Schatz, Covering radius\u2014survey and recent results, IEEE Trans. Inform. Theory, Vol. IT-31 (1985) pp. 328-343.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"240918_CR8","doi-asserted-by":"crossref","first-page":"1617","DOI":"10.1109\/18.623161","volume":"43","author":"G. D. Cohen","year":"1997","unstructured":"G. D. Cohen, I. Honkala, S. N. Litsyn, and P. Sol\u00e9, Long packing and covering codes, IEEE Trans. Inform. Theory, Vol. 43 (1997) pp. 1617-1623.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"240918_CR9","doi-asserted-by":"crossref","first-page":"680","DOI":"10.1109\/TIT.1986.1057227","volume":"IT-32","author":"G. D. Cohen","year":"1986","unstructured":"G. D. Cohen, A. C. Lobstein, and N. J. A. Sloane, Further results on the covering radius of codes, IEEE Trans. Inform. Theory, Vol. IT-32 (1986) pp. 680-694.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"195","key":"240918_CR10","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1090\/S0025-5718-1991-1079013-8","volume":"57","author":"R. Dougherty","year":"1991","unstructured":"R. Dougherty and H. Janwa, Covering radius computations for binary cyclic codes, Mathematics of Computation, Vol. 57No. 195 (1991) pp. 415-434. (With Microfiche supplements.)","journal-title":"Mathematics of Computation"},{"key":"240918_CR11","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1109\/TIT.1985.1057033","volume":"IT-31","author":"D. E. Downey","year":"1985","unstructured":"D. E. Downey and N. J. A. Sloane, The covering radius of cyclic codes of length up to 31, IEEE Trans. Inform. Theory, Vol. IT-31 (1985) pp. 446-447.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"240918_CR12","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/S0019-9958(60)90877-9","volume":"3","author":"D. Gorenstein","year":"1960","unstructured":"Gorenstein, Daniel, Peterson, W. Wesley, and Zierler, Neal, Two-error correcting Bose-Chaudhuri codes are quasi-perfect, Information and Control, Vol. 3 (1960) pp. 291-294.","journal-title":"Information and Control"},{"key":"240918_CR13","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1109\/TIT.1985.1057039","volume":"IT-31","author":"R. L. Graham","year":"1985","unstructured":"R. L. Graham and N. J. A. Sloane, On the covering radius of codes, IEEE Trans. Inform. Theory, Vol. IT-31 (1985) pp. 385-401.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"240918_CR14","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1147\/rd.45.0532","volume":"4","author":"J. H. Griesmer","year":"1960","unstructured":"J. H. Griesmer, A bound for error-correcting codes, IBM J. Res. Develop., Vol. 4 (1960) pp. 532-542.","journal-title":"IBM J. Res. Develop."},{"issue":"3","key":"240918_CR15","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1109\/18.54891","volume":"36","author":"X. Hou","year":"1990","unstructured":"Xiang-dong Hou, Some results on the norm of codes, IEEE Trans. Inform. Theory, Vol. 36,No. 3 (1990) pp. 683-685.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"240918_CR16","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1109\/18.75258","volume":"37","author":"X. Hou","year":"1991","unstructured":"Xiang-dong Hou, Binary linear quasi-perfect codes are normal, IEEE Trans. Inform. Theory, Vol. 37,No. 2 (1991) pp. 378-379.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"240918_CR17","unstructured":"H. Janwa, Relations among parameters of codes, Ph.D. dissertation, Syracuse Univ. (1986)."},{"key":"240918_CR18","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1109\/18.42182","volume":"IT-35","author":"H. Janwa","year":"1989","unstructured":"H. Janwa, Some new upper bounds on the covering radius of binary linear codes, IEEE Trans. Inform. Theory, Vol. IT-35 (1989) pp. 110-122.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"240918_CR19","unstructured":"H. Janwa and H. F. Mattson, jr, The covering radius and normality of t-dense codes, presented in part at the IEEE International Symp. on Inform. Theory, Ann Arbor, Michigan, October 6\u20139 (1986)."},{"key":"240918_CR20","unstructured":"H. Janwa, On the optimality and covering radii of some algebraic geometric codes, presented at the Workshop on Coding Theory, at Institute for Mathematics and Its Applications (IMA), University of Minnesota, June 13\u201324 (1988)."},{"key":"240918_CR21","unstructured":"H. Janwa, On the covering radii of q-ary codes, Proceedings of the IEEE International Symposium on Information, San Diego, May (1990). Abstract."},{"key":"240918_CR22","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/S0195-6698(13)80125-4","volume":"11","author":"H. Janwa","year":"1990","unstructured":"H. Janwa, Some optimal codes from algebraic geometry and their covering radii, Europ. J. Combinatorics, Vol. 11 (1990) pp. 249-266.","journal-title":"Europ. J. Combinatorics"},{"key":"240918_CR23","doi-asserted-by":"crossref","unstructured":"H. Janwa, On the parameters of algebraic geometric codes, Lecture Notes in Computer Science, Springer-Verlag, 539 (1991) pp. 19-28.","DOI":"10.1007\/3-540-54522-0_92"},{"issue":"4","key":"240918_CR24","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1137\/0608049","volume":"8","author":"K. E. Kilby","year":"1987","unstructured":"K. E. Kilby and N. J. A. Sloane, On the covering radius problem for codes: (I) Bounds on normalized covering radius, (II) Codes of low dimension; Normal and abnormal codes, SIAM J. Alg. Disc. Math., Vol. 8,no. 4 (1987) pp. 604-618; pp. 619\u2013627.","journal-title":"SIAM J. Alg. Disc. Math."},{"key":"240918_CR25","volume-title":"The Theory of Error-Correcting Codes","author":"F. J. MacWilliams","year":"1977","unstructured":"F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, North-Holland (1977)."},{"key":"240918_CR26","doi-asserted-by":"crossref","unstructured":"H. F. Mattson, Jr., An improved upper bound on covering radius, Proc. 2nd International Conf. AAECC, Toulouse, France, October 1984. Springer-Verlag Lect. Notes in Computer Sci., 228 (1986) pp. 90-106.","DOI":"10.1007\/3-540-16767-6_53"},{"key":"240918_CR27","doi-asserted-by":"crossref","first-page":"1344","DOI":"10.1109\/18.21266","volume":"34","author":"J. Simonis","year":"1988","unstructured":"J. Simonis, The minimum covering radius t[15, 6] of a 6-dimensional binary linear code of length 15 is equal to 4, IEEE Trans. Inform. Theory, Vol. 34 (1988) pp. 1344-1345.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"240918_CR28","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0097-3165(86)90007-5","volume":"42","author":"N. J. A. Sloane","year":"1986","unstructured":"N. J. A. Sloane, A new approach to the covering radius of codes, J. Combin. Theory, Ser. A., Vol. 42 (1986) pp. 61-86.","journal-title":"J. Combin. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008397405457.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008397405457\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008397405457.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T03:47:06Z","timestamp":1753760826000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008397405457"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,12]]},"references-count":28,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,12]]}},"alternative-id":["240918"],"URL":"https:\/\/doi.org\/10.1023\/a:1008397405457","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,12]]}}}