{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T10:14:19Z","timestamp":1742638459948},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,6,27]],"date-time":"2016-06-27T00:00:00Z","timestamp":1466985600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s12095-016-0196-3","type":"journal-article","created":{"date-parts":[[2016,6,27]],"date-time":"2016-06-27T06:10:45Z","timestamp":1467007845000},"page":"23-39","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Quasi-cyclic Goppa codes with special Goppa polynomials and matched location sets"],"prefix":"10.1007","volume":"9","author":[{"given":"Sergey","family":"Bezzateev","sequence":"first","affiliation":[]},{"given":"Natalia","family":"Shekhunova","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,27]]},"reference":[{"issue":"3","key":"196_CR1","first-page":"24","volume":"6","author":"VD Goppa","year":"1970","unstructured":"Goppa, V.D.: A new class of linear error-correcting codes. Probl. Inform. Transm. 6(3), 24\u201330 (1970)","journal-title":"Probl. Inform. Transm."},{"key":"196_CR2","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error Correcting Codes. Amsterdam \/New York\/ Oxford, North Holland (1977)"},{"key":"196_CR3","doi-asserted-by":"crossref","unstructured":"Blahut, R.E.: Algebraic codes for data transmission. Cambridge University Press (2003)","DOI":"10.1017\/CBO9780511800467"},{"key":"196_CR4","unstructured":"Peterson, W.W., Weldon, E.J.: Error-Correcting Codes. The MIT Press, Cambridge, Massachusets, and London, England (1972)"},{"issue":"11","key":"196_CR5","doi-asserted-by":"crossref","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. Inform. Theory. 59(11), 7379\u20137385 (2013)","journal-title":"IEEE Trans. Inform. Theory."},{"issue":"5","key":"196_CR6","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/S0019-9958(69)90497-5","volume":"15","author":"C Chen","year":"1969","unstructured":"Chen, C., Peterson, W., Weldon, E.: Some results on qusi-cyclic codes. Inf. and Control 15(5), 407\u2013423 (1969)","journal-title":"Inf. and Control"},{"issue":"6","key":"196_CR7","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1109\/TIT.1973.1055098","volume":"19","author":"ER Berlecamp","year":"1973","unstructured":"Berlecamp, E.R., Moreno, O.: Extended double-error-correcting binary Goppa codes are cyclic. IEEE Trans. Inform. Theory 19(6), 817\u2013818 (1973)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"196_CR8","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1109\/TIT.1979.1056016","volume":"25","author":"KK Tzeng","year":"1979","unstructured":"Tzeng, K.K., Yu, C.Y.: Characterization theorems for extending Goppa codes to cyclic codes. IEEE Trans. Inform. Theory 25(2), 246\u2013250 (1979)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"196_CR9","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1109\/TIT.1975.1055449","volume":"21","author":"KK Tzeng","year":"1975","unstructured":"Tzeng, K.K., Zimmermann, K.: On extending Goppa codes to cyclic codes. Trans. Inform. Theory 21(6), 712\u2013716 (1975)","journal-title":"Trans. Inform. Theory"},{"issue":"5","key":"196_CR10","doi-asserted-by":"crossref","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. Inform. Theory 25(5), 609\u2013612 (1979)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"196_CR11","first-page":"14","volume":"XVIII","author":"AL Vishnevetskiy","year":"1982","unstructured":"Vishnevetskiy, A.L.: On cyclicity of extended Goppa codes. Probl. Inform. Transm XVIII(3), 14\u201318 (1982)","journal-title":"Probl. Inform. Transm"},{"key":"196_CR12","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0097-3165(89)90045-9","volume":"51","author":"H Stichenoth","year":"1989","unstructured":"Stichenoth, H.: Which extended Goppa codes are cyclic?. J.Comb Theory. A 51, 205\u2013220 (1989)","journal-title":"J.Comb Theory. A"},{"issue":"4","key":"196_CR13","doi-asserted-by":"crossref","first-page":"1264","DOI":"10.1109\/18.761281","volume":"45","author":"TP Berger","year":"1999","unstructured":"Berger, T.P.: New classes of cyclic extended Goppa codes. IEEE Trans. Inform. Theory 45(4), 1264\u20131266 (1999)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"7","key":"196_CR14","doi-asserted-by":"crossref","first-page":"2628","DOI":"10.1109\/18.887871","volume":"46","author":"TP Berger","year":"2000","unstructured":"Berger, T.P.: Goppa and related codes invariant under a prescribed permutation. IEEE Trans. Inform. Theory 46(7), 2628\u20132633 (2000)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"196_CR15","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1006\/ffta.2000.0277","volume":"6","author":"TP 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":"196_CR16","first-page":"195","volume":"2000","author":"TP Berger","year":"2000","unstructured":"Berger, T.P.: Quasi-cyclic Goppa codes. Proc. ISIT2000, Sorrente Italie 2000, 195 (2000)","journal-title":"Proc. ISIT2000, Sorrente Italie"},{"issue":"12","key":"196_CR17","doi-asserted-by":"crossref","first-page":"5773","DOI":"10.1109\/TIT.2008.2006442","volume":"54","author":"S Bezzateev","year":"2008","unstructured":"Bezzateev, S., Shekhunova, N.: Chain of separable binary Goppa codes and their minimal distance. IEEE Trans. Inform. Theory 54(12), 5773\u20135778 (2008)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"196_CR18","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1109\/18.651048","volume":"44","author":"P Veron","year":"1998","unstructured":"Veron, P.: Goppa codes and trace operator. IEEE Trans. Inform. Theory 44(1), 290\u2013294 (1998)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"196_CR19","first-page":"41","volume":"7","author":"VD Goppa","year":"1971","unstructured":"Goppa, V.D.: A rational representation of codes and (L,g) codes. Probl. Inform. Transm. 7(3), 41\u201349 (1971)","journal-title":"Probl. Inform. Transm."},{"key":"196_CR20","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W Bosma","year":"1997","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system I: The user language. J. Symbolic Comput. 24, 235\u2013265 (1997)","journal-title":"J. Symbolic Comput."},{"key":"196_CR21","unstructured":"Chen, Z.: A database on binary quasi-cyclic codes. http:\/\/moodle.tec.hkr.se\/chen\/research\/codes\/qc.htm . Accessed on 2015-12-21"},{"key":"196_CR22","unstructured":"Grassl, M.: Tables of linear codes and quantum codes http:\/\/www.codetables.de . Accessed on 2015-12-21"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-016-0196-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12095-016-0196-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-016-0196-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-016-0196-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T17:14:07Z","timestamp":1498324447000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12095-016-0196-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,27]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["196"],"URL":"https:\/\/doi.org\/10.1007\/s12095-016-0196-3","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,27]]}}}