{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T17:40:04Z","timestamp":1748540404337,"version":"3.41.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319172958"},{"type":"electronic","value":"9783319172965"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-17296-5_5","type":"book-chapter","created":{"date-parts":[[2015,7,24]],"date-time":"2015-07-24T14:30:01Z","timestamp":1437748201000},"page":"53-60","source":"Crossref","is-referenced-by-count":1,"title":["Cyclic Generalized Separable (L, G) Codes"],"prefix":"10.1007","author":[{"given":"Sergey","family":"Bezzateev","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"Goppa,V.D.: A new class of linear error-correcting codes. Probl. Inf. Trans. 6(3), 24\u201330 (1970)"},{"issue":"6","key":"5_CR2","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1109\/TIT.1973.1055098","volume":"19","author":"E.R. Berlecamp","year":"1973","unstructured":"Berlecamp, E.R., Moreno, O.: Extended double-error-gorrecting binary Goppa codes are cyclic. IEEE Trans. Inf. Theory 19(6), 817\u2013818 (1973)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"5_CR3","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TIT.1975.1055449","volume":"21","author":"K.K. Tzeng","year":"1975","unstructured":"Tzeng, K.K., Zimmermann, K.: On extending Goppa codes to cyclic codes. IEEE Trans. Inf. Theory 21(6), 712\u2013716 (1975)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"5_CR4","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1109\/TIT.1979.1056016","volume":"25","author":"K.K. Tzeng","year":"1979","unstructured":"Tzeng, K.K., Yu, C.Y.: Characterization theorems for extending Goppa codes to cyclic codes. IEEE Trans. Inf. Theory 25(2), 246\u2013250 (1979)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"5_CR5","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1109\/TIT.1979.1056089","volume":"25","author":"O. Moreno","year":"1979","unstructured":"Moreno, O.: Symmetries of binary Goppa codes. IEEE Trans. Inf. Theory 25(5), 609\u2013612 (1979)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"5_CR6","first-page":"14","volume":"18","author":"A.L. Vishnevetskii","year":"1982","unstructured":"Vishnevetskii, A.L.: Cyclicity of extended Goppa codes. Probl. Pered. Inf. 18(3), 14\u201318 (1982)","journal-title":"Probl. Pered. Inf."},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Stichenoth, H.: Wich extended Goppa codes are cyclic? J. Comb. Theory A 51, 205\u2013220 (1989)","DOI":"10.1016\/0097-3165(89)90045-9"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"B erger, T.P.: Goppa and related codes invariant under a prescribed permutation. IEEE Trans. Inf. Theory 46(7), 2628\u20132633 (2000)","DOI":"10.1109\/18.887871"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1006\/ffta.2000.0277","volume":"6","author":"T.P. Berger","year":"2000","unstructured":"Berger, T.P.: On the cyclicity of Goppa codes, parity-check subcodes of Goppa codes, and extended Goppa codes. Finite Fields Appl. 6, 255\u2013281 (2000)","journal-title":"Finite Fields Appl."},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Berger, T.P.: Quasi-cyclic Goppa codes. In: Proceedings of ISIT2000, Sorrente, p.\u00a0195 (2000)","DOI":"10.1109\/ISIT.2000.866493"},{"issue":"4","key":"5_CR11","doi-asserted-by":"publisher","first-page":"1264","DOI":"10.1109\/18.761281","volume":"45","author":"T.P. Berger","year":"1999","unstructured":"Berger, T.P.: New classes of cyclic extended Goppa codes. IEEE Trans. Inf. Theory 45(4), 1264\u20131266 (1999)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"5_CR12","volume-title":"The Theory of Error-Correcting Codes","author":"F.J. MacWilliams","year":"1977","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977)"},{"issue":"11","key":"5_CR13","doi-asserted-by":"publisher","first-page":"7379","DOI":"10.1109\/TIT.2013.2278176","volume":"59","author":"S. Bezzateev","year":"2013","unstructured":"Bezzateev, S., Shekhunova, N.: Subclass of cyclic Goppa codes. IEEE Trans. Inf. Theory 59(11), 7379\u20137385 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"5_CR14","unstructured":"Shekhunova, N.A., Mironchikov, E.T.: Cyclic (L, g)-codes. Probl. Pered. Inf. 17(2), 3\u20139 (1981)"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Bezzateev, S.V., Shekhunova, N.A.: One generalization of Goppa codes. In: Proceedings of ISIT-97, Ulm, p.\u00a0299 (1997)","DOI":"10.1109\/ISIT.1997.613221"},{"issue":"6","key":"5_CR16","doi-asserted-by":"publisher","first-page":"3951","DOI":"10.1109\/TIT.2012.2185924","volume":"58","author":"A. Zeh","year":"2012","unstructured":"Zeh, A., Wachter-Zeh, A., Bezzateev, S.: Decoding cyclic codes up to a new bound on the minimum distance. IEEE Trans. Inf. Theory 58(6), 3951\u20133960 (2012)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s10623-012-9721-3","volume":"71","author":"A. Zeh","year":"2014","unstructured":"Zeh, A., Bezzateev, S.: A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes. Designs Codes Cryptogr. 71, 229\u2013246 (2014)","journal-title":"Designs Codes Cryptogr."}],"container-title":["CIM Series in Mathematical Sciences","Coding Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-17296-5_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T17:22:02Z","timestamp":1748539322000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-17296-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319172958","9783319172965"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-17296-5_5","relation":{},"ISSN":["2364-950X","2364-9518"],"issn-type":[{"type":"print","value":"2364-950X"},{"type":"electronic","value":"2364-9518"}],"subject":[],"published":{"date-parts":[[2015]]}}}