{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T19:06:22Z","timestamp":1754161582745,"version":"3.41.2"},"reference-count":4,"publisher":"Springer Science and Business Media LLC","issue":"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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"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,3]]},"DOI":"10.1023\/a:1008215504578","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T08:47:34Z","timestamp":1040546854000},"page":"223-227","source":"Crossref","is-referenced-by-count":1,"title":["The Covering Radius of Ternary Cyclic Codes with Length up to 25"],"prefix":"10.1007","volume":"13","author":[{"given":"Tsonka Stefanova","family":"Baicheva","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"150396_CR1","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1109\/TIT.1985.1057043","volume":"IT-31","author":"G. Cohen","year":"1985","unstructured":"G. Cohen, M. Karpovsky, H. Mattson and J. Schatz, Covering radius-Survey and recent results, IEEE Trans. Inf. Theory, Vol. IT-31 (1985) pp. 328-343.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"150396_CR2","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1109\/TIT.1985.1057033","volume":"IT-31","author":"D. Downie","year":"1985","unstructured":"D. Downie and N. J. A. Sloane, The covering radius of cyclic codes of length up to 31, IEEE Trans. Inf. Theory, Vol. IT-31 (1985) pp. 446-447.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"150396_CR3","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1109\/18.212272","volume":"IT-39","author":"M. van Eupen","year":"1993","unstructured":"M. van Eupen and J. H. van Lint, On the minimum distance of ternary cyclic codes, IEEE Trans. Inf. Theory, Vol. IT-39 (1993) pp. 409-422.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"150396_CR4","first-page":"215","volume":"81","author":"E. Velikova","year":"1987","unstructured":"E. Velikova and K. Manev, The covering radius of cyclic codes of lengths 33, 35 and 39, Annuaire de L'Universite de Sofia, Tome 81 (1987) pp. 215-223.","journal-title":"Annuaire de L'Universite de Sofia"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008215504578.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008215504578\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008215504578.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T03:44:00Z","timestamp":1753760640000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008215504578"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":4,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["150396"],"URL":"https:\/\/doi.org\/10.1023\/a:1008215504578","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}