{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,11]],"date-time":"2023-07-11T04:40:18Z","timestamp":1689050418712},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,3,13]],"date-time":"2014-03-13T00:00:00Z","timestamp":1394668800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2015,8]]},"DOI":"10.1007\/s10623-014-9927-7","type":"journal-article","created":{"date-parts":[[2014,3,12]],"date-time":"2014-03-12T04:48:42Z","timestamp":1394599722000},"page":"173-178","source":"Crossref","is-referenced-by-count":0,"title":["On some bounds on the minimum distance of cyclic codes over finite fields"],"prefix":"10.1007","volume":"76","author":[{"given":"Ferruh","family":"\u00d6zbudak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seher","family":"Tutdere","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"O\u011fuz","family":"Yayla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,3,13]]},"reference":[{"key":"9927_CR1","doi-asserted-by":"crossref","unstructured":"Bose R.C., Chaudhuri, D.K.R.: On a class of error correcting binary group codes. Inf. Control 3(1), 68\u201379 (1960).","DOI":"10.1016\/S0019-9958(60)90287-4"},{"key":"9927_CR2","doi-asserted-by":"crossref","unstructured":"Bosma W., Cannon J., Playoust C.: The Magma algebra system. I. The user language. J. Symb. Comput. 24, 235\u2013265 (1997).","DOI":"10.1006\/jsco.1996.0125"},{"key":"9927_CR3","doi-asserted-by":"crossref","unstructured":"Boston N.: Bounding minimum distances of cyclic codes using algebraic geometry. Electron. Notes Discret. Math. 6, 385\u2013394 (2001).","DOI":"10.1016\/S1571-0653(04)00190-8"},{"key":"9927_CR4","unstructured":"Grayson D.R., Stillman M.E.: Macaulay2, a software system for research in algebraic geometry. http:\/\/www.math.uiuc.edu\/Macaulay2\/ ."},{"key":"9927_CR5","doi-asserted-by":"crossref","unstructured":"Hartmann C., Tzeng K.: Generalizations of the BCH bound. Inf. Control 20(5), 489\u2013498 (1972).","DOI":"10.1016\/S0019-9958(72)90887-X"},{"key":"9927_CR6","doi-asserted-by":"crossref","unstructured":"Hartmann C., Tzeng K.: Decoding beyond the BCH bound using multiple sets of syndrome sequences. IEEE Trans. Inf. Theory 20(2), 292\u2013295 (1974).","DOI":"10.1109\/TIT.1974.1055178"},{"key":"9927_CR7","doi-asserted-by":"crossref","unstructured":"Hartmann C., Tzeng K., Chien R.: Some results on the minimum distance structure of cyclic codes. IEEE Trans. Inf. Theory 18(3), 402\u2013409 (1972).","DOI":"10.1109\/TIT.1972.1054816"},{"key":"9927_CR8","unstructured":"Hocquenghem A.: Codes correcteurs d-Erreurs. Chiffres (Paris) 2, 147\u2013156 (1959)."},{"key":"9927_CR9","doi-asserted-by":"crossref","unstructured":"Roos C.: A generalization of the BCH bound for cyclic codes, including the Hartmann\u2013Tzeng bound. J. Comb. Theory Ser. A 33(2), 229\u2013232 (1982).","DOI":"10.1016\/0097-3165(82)90014-0"},{"key":"9927_CR10","doi-asserted-by":"crossref","unstructured":"Roos C.: A new lower bound for the minimum distance of a cyclic code. IEEE Trans. Inf. Theory 29(3), 330\u2013332 (1983).","DOI":"10.1109\/TIT.1983.1056672"},{"key":"9927_CR11","doi-asserted-by":"crossref","unstructured":"Stichtenoth H.: Algebraic function fields and codes. Graduate Texts in Mathematics, 2nd edn, p. 254. Springer, Berlin (2009).","DOI":"10.1007\/978-3-540-76878-4"},{"key":"9927_CR12","doi-asserted-by":"crossref","unstructured":"Zeh A., Bezzateev S.V.: A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes. Des. Codes Cryptogr. (2012). doi: 10.1007\/s10623-012-9721-3 .","DOI":"10.1007\/s10623-012-9721-3"},{"key":"9927_CR13","doi-asserted-by":"crossref","unstructured":"Zeh A., Wachter-Zeh A., Bezzateev S.V.: Decoding cyclic codes up to a new bound on the minimum distance. IEEE Trans. Inf. Theory 58(6), 3951\u20133960 (2012).","DOI":"10.1109\/TIT.2012.2185924"},{"key":"9927_CR14","doi-asserted-by":"crossref","unstructured":"Zeh A., Wachter-Zeh A., Gadouleau M., Bezzateev S.V.: Generalizing bounds on the minimum distance of cyclic codes using cyclic product codes. Proceedings of IEEE ISIT-2013, pp. 126\u2013130. Istanbul, Turkey (2013). doi: 10.1109\/ISIT.2013.6620201 .","DOI":"10.1109\/ISIT.2013.6620201"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-014-9927-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-014-9927-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-014-9927-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,11]],"date-time":"2023-07-11T04:05:16Z","timestamp":1689048316000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-014-9927-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,13]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,8]]}},"alternative-id":["9927"],"URL":"https:\/\/doi.org\/10.1007\/s10623-014-9927-7","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3,13]]}}}