{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:06:21Z","timestamp":1753887981691},"reference-count":22,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"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":5617,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1998,3]]},"DOI":"10.1016\/s0166-218x(97)00134-0","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"177-191","source":"Crossref","is-referenced-by-count":3,"title":["On the covering radius of an unrestricted code as a function of the rate and dual distance"],"prefix":"10.1016","volume":"82","author":[{"given":"Simon","family":"Litsyn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"Sol\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ren\u00e9","family":"Struik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(97)00134-0_BIB1","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF01294330","article-title":"On r-partition designs in Hamming spaces","volume":"2","author":"Camion","year":"1992","journal-title":"AAECC"},{"key":"10.1016\/S0166-218X(97)00134-0_BIB2","series-title":"Introduction to Approximation Theory","author":"Cheney","year":"1966"},{"key":"10.1016\/S0166-218X(97)00134-0_BIB3","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1137\/S0895480191217776","article-title":"An upper bound on the diameter of a graph from eigenvalues associated with its Laplacian","volume":"7","author":"Chung","year":"1994","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(97)00134-0_BIB4","series-title":"Covering Codes","author":"Cohen","year":"1947"},{"key":"10.1016\/S0166-218X(97)00134-0_BIB5","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1109\/TIT.1985.1057043","article-title":"Covering radius survey and recent results","volume":"IT-31","author":"Cohen","year":"1985","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0166-218X(97)00134-0_BIB6","article-title":"An algebraic approach to the association schemes of coding theory","author":"Delsarte","year":"1973"},{"key":"10.1016\/S0166-218X(97)00134-0_BIB7","first-page":"407","article-title":"Four fundamental parameters of a code","volume":"23","author":"Delsarte","year":"1973","journal-title":"MBLE Research Lab., Report R 184, January 1972: Inform. Control"},{"key":"10.1016\/S0166-218X(97)00134-0_BIB8","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0097-3165(95)90093-4","article-title":"On upper bounds for code distance and covering radius of designs in polynomial metric spaces","volume":"70","author":"Fazekas","year":"1995","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/S0166-218X(97)00134-0_BIB9","unstructured":"I. Honkala, T. Laihonen, S. Litsyn, Un covering codes and discrete Chebyshev polynomials, Applicable Algebra in Engineering, Communication and Computing, to appear."},{"key":"10.1016\/S0166-218X(97)00134-0_BIB10","first-page":"21","article-title":"On algebraic methods in covering radius problems","volume":"vol. 948","author":"Honkala","year":"1995"},{"key":"10.1016\/S0166-218X(97)00134-0_BIB11","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1109\/TIT.1978.1055928","article-title":"On the covering radius of binary codes","volume":"IT-24","author":"Helleseth","year":"1978","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2\/3","key":"10.1016\/S0166-218X(97)00134-0_BIB12","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1006\/eujc.1996.0022","article-title":"Upper bounds on the covering radius of a code with a given dual distance","volume":"17","author":"Litsyn","year":"1996","journal-title":"Europ. J. Combin."},{"key":"10.1016\/S0166-218X(97)00134-0_BIB13","series-title":"Introduction to Coding Theory","author":"van Lint","year":"1982"},{"key":"10.1016\/S0166-218X(97)00134-0_BIB14","series-title":"The Theory of Error-Correcting Codes","author":"MacWilliams","year":"1977"},{"key":"10.1016\/S0166-218X(97)00134-0_BIB15","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1109\/TIT.1977.1055688","article-title":"New upper bounds on the rate of a code via the Delsarte MacWilliams inequalities","volume":"IT-23","author":"McEliece","year":"1977","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0166-218X(97)00134-0_BIB16","series-title":"The Chebyshev Polynomials","author":"Rivlin","year":"1990"},{"key":"10.1016\/S0166-218X(97)00134-0_BIB17","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1109\/18.370102","article-title":"Packing radius, covering radius and dual distance","volume":"IT-41","author":"Sol\u00e9","year":"1995","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0166-218X(97)00134-0_BIB18","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1109\/18.61138","article-title":"Generalization of the Norse bounds to codes of higher strengths","volume":"IT-37","author":"Sol\u00e9","year":"1991","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0166-218X(97)00134-0_BIB19","doi-asserted-by":"crossref","first-page":"1195","DOI":"10.1109\/18.243438","article-title":"Covering radius, codimension, and dual-distance width","volume":"IT-39","author":"Sol\u00e9","year":"1993","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0166-218X(97)00134-0_BIB20","article-title":"Covering codes","author":"Struik","year":"1994"},{"key":"10.1016\/S0166-218X(97)00134-0_BIB21","doi-asserted-by":"crossref","first-page":"1472","DOI":"10.1109\/18.59949","article-title":"An upper bound on the covering radius as a function of the dual distance","volume":"IT-36","author":"Tiet\u00e4v\u00e4inen","year":"1990","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0166-218X(97)00134-0_BIB22","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF00123957","article-title":"Covering radius and dual distance","volume":"1","author":"Tiet\u00e4v\u00e4inen","year":"1991","journal-title":"Designs, Codes Cryptography"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97001340?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97001340?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:27:06Z","timestamp":1556666826000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X97001340"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":22,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0166218X97001340"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(97)00134-0","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}