{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T16:23:37Z","timestamp":1769271817949,"version":"3.49.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1998,4,1]],"date-time":"1998-04-01T00:00:00Z","timestamp":891388800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,4,1]],"date-time":"1998-04-01T00:00:00Z","timestamp":891388800000},"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,4]]},"DOI":"10.1023\/a:1008260505585","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T08:47:34Z","timestamp":1040546854000},"page":"71-80","source":"Crossref","is-referenced-by-count":21,"title":["On Upper Bounds for Minimum Distance and Covering Radius of Non-binary Codes"],"prefix":"10.1007","volume":"14","author":[{"given":"Tero","family":"Laihonen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Litsyn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"153103_CR1","unstructured":"M. Aaltonen, Bounds on the information rate of a tree code as a function on the code's feedback decoding minimum distance, Ann. Univ. Turku. Ser. A I, Vol. 181 (1981)."},{"key":"153103_CR2","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0012-365X(90)90002-Y","volume":"83","author":"M. Aaltonen","year":"1990","unstructured":"M. Aaltonen, A new upper bound on nonbinary block codes, Discrete Math., Vol. 83 (1990), pp. 139-160.","journal-title":"Discrete Math."},{"key":"153103_CR3","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1137\/S0895480191217776","volume":"7","author":"F. R. K. Chung","year":"1994","unstructured":"F. R. K. Chung, V. Faber and T. A. Manteuffel, An upper bound on the diameter of a graph from eigenvalues associated with its Laplacian, SIAM J. Discr. Math., Vol. 7 (1994) pp. 443-457.","journal-title":"SIAM J. Discr. Math."},{"key":"153103_CR4","unstructured":"G. Cohen, I. Honkala, S. Litsyn and A. Lobstein, Covering Codes, Elsevier, Amsterdam (1997)."},{"key":"153103_CR5","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/s002000050061","volume":"8","author":"G. Cohen","year":"1997","unstructured":"G. Cohen, S. Litsyn, A. Lobstein and H. Mattson, Jr., Covering radius 1985-1994, Applicable Algebra in Engineering, Communication and Computing, Vol. 8 (1997) pp. 173-239.","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"key":"153103_CR6","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0195-6698(13)80076-5","volume":"12","author":"C. Delorme","year":"1991","unstructured":"C. Delorme and P. Sol\u00e9, Diameter, covering index, covering radius and eigenvalues, Europ. J. Combin., Vol 12 (1991) pp. 95-108.","journal-title":"Europ. J. Combin."},{"key":"153103_CR7","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/S0019-9958(73)80007-5","volume":"23","author":"P. Delsarte","year":"1973","unstructured":"P. Delsarte, Four fundamental parameters of a code and their combinatorial significance, Information and Control, Vol. 23 (1973) pp. 407-438.","journal-title":"Information and Control"},{"key":"153103_CR8","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1109\/TIT.1978.1055928","volume":"24","author":"T. Helleseth","year":"1978","unstructured":"T. Helleseth, T. Kl\u00f8ve, and J. Mykkeltveit, On the covering radius of binary codes, IEEE Trans. Inform. Theory, Vol. 24 (1978) pp. 627-628.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"153103_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"Applied Algebra, Albegraic Algorithms and Error-Correcting Codes","author":"I. Honkala","year":"1995","unstructured":"I. Honkala, S. Litsyn, and A. Tiet\u00e4v\u00e4inen, On algebraic methods in covering radius problems, In: Cohen, G., Giusti M., Mora, T. (eds.) Applied Algebra, Albegraic Algorithms and Error-Correcting Codes. Lecture Notes in Computer Science, Vol 948. Berlin, Heidelberg, New York: Springer (1995)."},{"key":"153103_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-07998-0","volume-title":"Introduction to Coding Theory","author":"J. van Lint","year":"1982","unstructured":"J. van Lint, Introduction to Coding Theory, Springer-Verlag, Berlin, Heidelberg, New York (1982)."},{"key":"153103_CR11","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1006\/eujc.1996.0022","volume":"17","author":"S. Litsyn","year":"1996","unstructured":"S. Litsyn and A. Tiet\u00e4v\u00e4inen, Upper bounds on the covering radius of a code with a given dual distance, Europ. J. Combin., vol. 17 (1996) pp. 265-270.","journal-title":"Europ. J. Combin."},{"key":"153103_CR12","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF02126799","volume":"6","author":"A. Lubotszky","year":"1988","unstructured":"A. Lubotszky, R. Phillips and P. Sarnak, Ramanujan graphs, Combinatorica, Vol. 8 (1988) pp. 261-277.","journal-title":"Combinatorica"},{"key":"153103_CR13","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, North-Holland, Amsterdam (1977)."},{"key":"153103_CR14","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1109\/TIT.1977.1055688","volume":"23","author":"R. McEliece","year":"1977","unstructured":"R. McEliece, E. Rodemich, H. Jr. Rumsey and L. Welch, New upper bounds on the rate of a code via Delsarte-MacWilliams inequalities, IEEE Trans. Inform. Theory, Vol. 23 (1977) pp. 157-167.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"153103_CR15","volume-title":"The Chebyshev polynomials","author":"T. Rivlin","year":"1974","unstructured":"T. Rivlin, The Chebyshev polynomials, John Wiley & Sons, New York (1974)."},{"key":"153103_CR16","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1016\/S0019-9958(67)91200-4","volume":"10","author":"C. E. Shannon","year":"1967","unstructured":"C. E. Shannon, R. G. Gallager and E. R. Berlekamp, Lower bounds to error probability for coding on discrete memoryless channels. II, Information and Control, Vol. 10, (1967), pp. 522-552.","journal-title":"Information and Control"},{"key":"153103_CR17","doi-asserted-by":"crossref","first-page":"1470","DOI":"10.1109\/18.59948","volume":"36","author":"P. Sol\u00e9","year":"1990","unstructured":"P. Sol\u00e9, Asymptotic bounds on the covering radius of binary codes, IEEE Trans. Inform. Theory, Vol. 36, (1990), pp. 1470-1472.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"153103_CR18","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1109\/18.61138","volume":"37","author":"P. Sol\u00e9","year":"1991","unstructured":"P. Sol\u00e9 and K. Mehrotra, Generalization of the Norse bounds to codes of higher strength, IEEE Trans. Inform. Theory, Vol. 37 (1991) pp. 190-192.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"153103_CR19","doi-asserted-by":"crossref","first-page":"1195","DOI":"10.1109\/18.243438","volume":"39","author":"P. Sol\u00e9","year":"1993","unstructured":"P. Sol\u00e9 and P. Stokes, Covering radius, codimension, and dual-distance width, IEEE Trans. Inform. Theory, Vol. 39 (1993) pp. 1195-1203.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"153103_CR20","volume-title":"Orthogonal Polynomials","author":"G. Szeg\u00f6","year":"1975","unstructured":"G. Szeg\u00f6, Orthogonal Polynomials, Colloquium Publications, vol. 23, American Math. Soc., Providence, RI (1975)."},{"key":"153103_CR21","doi-asserted-by":"crossref","first-page":"1472","DOI":"10.1109\/18.59949","volume":"36","author":"A. Tiet\u00e4v\u00e4inen","year":"1990","unstructured":"A. Tiet\u00e4v\u00e4inen, An upper bound on the covering radius as a function of its dual distance, IEEE Trans. Inform. Theory, Vol. 36 (1990) pp. 1472-1474.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"153103_CR22","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF00123957","volume":"1","author":"A. Tiet\u00e4v\u00e4inen","year":"1991","unstructured":"A. Tiet\u00e4v\u00e4inen, Covering radius and dual distance, Designs, Codes and Cryptography, Vol. 1 (1991) pp. 31-46.","journal-title":"Designs, Codes and Cryptography"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008260505585.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008260505585\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008260505585.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T03:41:07Z","timestamp":1753760467000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008260505585"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,4]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,4]]}},"alternative-id":["153103"],"URL":"https:\/\/doi.org\/10.1023\/a:1008260505585","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,4]]}}}