{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T21:06:11Z","timestamp":1758056771512,"version":"3.44.0"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2025,5,23]],"date-time":"2025-05-23T00:00:00Z","timestamp":1747958400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,23]],"date-time":"2025-05-23T00:00:00Z","timestamp":1747958400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s10623-025-01648-2","type":"journal-article","created":{"date-parts":[[2025,5,23]],"date-time":"2025-05-23T11:27:18Z","timestamp":1747999638000},"page":"3507-3519","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Self-reversible generalized (L,G)-codes"],"prefix":"10.1007","volume":"93","author":[{"given":"Sergey","family":"Bezzateev","sequence":"first","affiliation":[]},{"given":"Natalia","family":"Shekhunova","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,5,23]]},"reference":[{"key":"1648_CR1","doi-asserted-by":"crossref","unstructured":"Bezzateev S.V., Shekhunova N.A.: Generalized Goppa codes for correcting localized errors. In: IEEE International Symposium on Information Theory, Boston, p. 377 (1998).","DOI":"10.1109\/ISIT.1998.708982"},{"key":"1648_CR2","doi-asserted-by":"crossref","unstructured":"Bezzateev S.V., Shekhunova N.A.: One generalization of Goppa codes. In: Proceedings of ISIT-97, Ulm, Germany, p. 299 (1997).","DOI":"10.1109\/ISIT.1997.613221"},{"key":"1648_CR3","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/s10623-012-9739-6","volume":"66","author":"SV Bezzateev","year":"2013","unstructured":"Bezzateev S.V., Shekhunova N.A.: Class of generalized Goppa codes perfect in weighted Hamming metric. Des. Codes Cryptogr. 66, 391\u2013399 (2013).","journal-title":"Des. Codes Cryptogr."},{"key":"1648_CR4","first-page":"212","volume":"227","author":"L Carlitz","year":"1967","unstructured":"Carlitz L.: Some theorems on irreducible reciprocal polynomials over a finite field. J. Reine Angew. Math. (Crelles J.) 227, 212\u2013220 (1967).","journal-title":"J. Reine Angew. Math. (Crelles J.)"},{"issue":"3","key":"1648_CR5","first-page":"24","volume":"6","author":"VD Goppa","year":"1970","unstructured":"Goppa V.D.: A new class of linear error-correcting codes. Probl. Inf. Transm. 6(3), 24\u201330 (1970) (in Russian).","journal-title":"Probl. Inf. Transm."},{"issue":"3","key":"1648_CR6","first-page":"41","volume":"7","author":"VD Goppa","year":"1971","unstructured":"Goppa V.D.: Rational representation of codes and $$(L, g)-$$codes. Prob. Inf. Transmiss. 7(3), 41\u201349 (1971) (in Russian).","journal-title":"Prob. Inf. Transmiss."},{"key":"1648_CR7","doi-asserted-by":"crossref","unstructured":"Liu H., Pircher S., Zeh A., Wachter-Zeh A.: Decoding of (interleaved) generalized Goppa codes. In: 2021 IEEE International Symposium on Information Theory (ISIT), Melbourne, Australia, pp. 664\u2013669 (2021).","DOI":"10.1109\/ISIT45174.2021.9517785"},{"key":"1648_CR8","volume-title":"The Theory of Error-Correcting Codes","author":"FJ MacWilliams","year":"1977","unstructured":"MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977)."},{"key":"1648_CR9","unstructured":"Meyn H., G\u00f6tz W.A.: Self-reciprocal polynomials over finite fields. Semin. Lotharingien Combin. [electronic only] 21 (1989). http:\/\/eudml.org\/doc\/122609. Accessed 23 June 2024."},{"issue":"2","key":"1648_CR10","first-page":"3","volume":"17","author":"NA Shekhunova","year":"1981","unstructured":"Shekhunova N.A., Mironchikov E.T.: Cyclic(L, G)-codes. Probl. Inf. Transm. 17(2), 3\u20139 (1981).","journal-title":"Probl. Inf. Transm."},{"key":"1648_CR11","doi-asserted-by":"crossref","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. Des. Codes Cryptogr. 71, 229\u2013246 (2014).","journal-title":"Des. Codes Cryptogr."},{"issue":"6","key":"1648_CR12","doi-asserted-by":"crossref","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"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01648-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-025-01648-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01648-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,15]],"date-time":"2025-09-15T17:30:34Z","timestamp":1757957434000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-025-01648-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,23]]},"references-count":12,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["1648"],"URL":"https:\/\/doi.org\/10.1007\/s10623-025-01648-2","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2025,5,23]]},"assertion":[{"value":"26 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 May 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 May 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}