{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T03:15:48Z","timestamp":1775013348191,"version":"3.50.1"},"reference-count":21,"publisher":"Pleiades Publishing Ltd","issue":"3","license":[{"start":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T00:00:00Z","timestamp":1283299200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T00:00:00Z","timestamp":1283299200000},"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":["Probl Inf Transm"],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1134\/s0032946010030038","type":"journal-article","created":{"date-parts":[[2010,10,18]],"date-time":"2010-10-18T07:01:57Z","timestamp":1287385317000},"page":"225-244","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Special classes of separable Goppa codes with improved parameter estimates"],"prefix":"10.1134","volume":"46","author":[{"given":"S. V.","family":"Bezzateev","sequence":"first","affiliation":[]},{"given":"N. A.","family":"Shekhunova","sequence":"additional","affiliation":[]}],"member":"137","published-online":{"date-parts":[[2010,10,19]]},"reference":[{"issue":"3","key":"4081_CR1","first-page":"24","volume":"6","author":"V.D. Goppa","year":"1970","unstructured":"Goppa, V.D., A New Class of Linear Correcting Codes, Probl. Peredachi Inf., 1970, vol. 6, no. 3, pp. 24\u201330 [Probl. Inf. Trans. (Engl. Transl.), 1970, vol. 6, no. 3, pp. 207\u2013212].","journal-title":"Probl. Peredachi Inf."},{"issue":"5","key":"4081_CR2","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1109\/TIT.1984.1056946","volume":"30","author":"M. Loeloeian","year":"1984","unstructured":"Loeloeian, M. and Conan, J., A (55, 16, 19) Binary Goppa Code, IEEE Trans. Inform. Theory. 1984, vol. 30, no. 5, pp. 773.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"4081_CR3","first-page":"119","volume":"23","author":"S.V. Bezzateev","year":"1987","unstructured":"Bezzateev, S.V. and Shekhunova, N.A., On the Designed Distance of the Best Known (55, 16, 19) Goppa Code, Probl. Peredachi Inf., 1987, vol. 23, no. 4, p. 119 [Probl. Inf. Trans. (Engl. Transl.), 1987, vol. 23, no. 4, p. 352].","journal-title":"Probl. Peredachi Inf."},{"issue":"3","key":"4081_CR4","first-page":"98","volume":"25","author":"N.A. Shekhunova","year":"1989","unstructured":"Shekhunova, N.A., Bezzateev, S.V., and Mironchikov, E.T., A Subclass of Binary Goppa Codes, Probl. Peredachi Inf., 1989, vol. 25, no. 3, pp. 98\u2013102 [Probl. Inf. Trans. (Engl. Transl.), 1989, vol. 25, no. 3, pp. 247\u2013250].","journal-title":"Probl. Peredachi Inf."},{"issue":"1","key":"4081_CR5","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1023\/A:1008252303768","volume":"14","author":"S.V. Bezzateev","year":"1998","unstructured":"Bezzateev, S.V. and Shekhunova, N.A., A Subclass of Binary Goppa Codes with Improved Estimation of the Code Dimension, Des. Codes Cryptogr., 1998, vol. 14, no. 1, pp. 23\u201338.","journal-title":"Des. Codes Cryptogr."},{"key":"4081_CR6","doi-asserted-by":"crossref","unstructured":"Bezzateev, S.V. and Shekhunova, N.A., Quasi-cyclic Goppa Codes, in Proc. 1995 IEEE Int. Sympos. on Information Theory, Whistler, Canada, 1995, p. 499.","DOI":"10.1109\/ISIT.1995.550486"},{"issue":"1","key":"4081_CR7","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1109\/18.651048","volume":"44","author":"P. V\u00e9ron","year":"1998","unstructured":"V\u00e9ron, P., Goppa Codes and Trace Operator, IEEE Trans. Inform. Theory, 1998, vol. 44, no. 1, pp. 290\u2013295.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"4081_CR8","first-page":"107","volume":"8","author":"V.D. Goppa","year":"1972","unstructured":"Goppa, V.D., Codes Constructed on the Base of (L, g)-Codes, Probl. Peredachi Inf., 1972, vol. 8, no. 2, pp. 107\u2013109 [Probl. Inf. Trans. (Engl. Transl.), 1972, vol. 8, no. 2, pp. 165\u2013166].","journal-title":"Probl. Peredachi Inf."},{"issue":"5","key":"4081_CR9","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1109\/TIT.1973.1055088","volume":"19","author":"E.R. Berlekamp","year":"1973","unstructured":"Berlekamp, E.R., Goppa Codes, IEEE Trans. Inform. Theory, 1973, vol. 19, no. 5, pp. 590\u2013592.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4081_CR10","doi-asserted-by":"crossref","unstructured":"Berger, T., Quasi-cyclic Goppa Codes, in Proc. 2000 IEEE Int. Sympos. on Information Theory, Sorrento, Italy, 2000, p. 195.","DOI":"10.1109\/ISIT.2000.866493"},{"key":"4081_CR11","unstructured":"Zimba, M. and Ryan, J.A., Quintic Ternary Goppa Codes of Length 27, in Proc. 26th SAMSA Conf., Maputo, Mozambique, 2008, p. 106."},{"issue":"12","key":"4081_CR12","doi-asserted-by":"publisher","first-page":"5773","DOI":"10.1109\/TIT.2008.2006442","volume":"54","author":"S. Bezzateev","year":"2008","unstructured":"Bezzateev, S. and Shekhunova, N., Chain of Separable Binary Goppa Codes and Their Minimal Distance, IEEE Trans. Inform. Theory, 2008, vol. 54, no. 12, pp. 5773\u20135778.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4081_CR13","volume-title":"The Theory of Error-Correcting Codes","author":"F.J. MacWilliams","year":"1977","unstructured":"MacWilliams, F.J. and Sloane, N.J.A., The Theory of Error-Correcting Codes, Amsterdam: North-Holland, 1977. Translated under the title Teoriya kodov, ispravlyayushchikh oshibki, Moscow: Svyaz\u2019, 1979."},{"key":"4081_CR14","first-page":"140","volume-title":"Proc. 9th Sympos. on the Relability Problem in Information Systems, Leningrad","author":"N.A. Shekhunova","year":"1986","unstructured":"Shekhunova, N.A., Bezzateev, S.V., and Mironchikov, E.T., One Subclass of Binary Goppa Codes, in Proc. 9th Sympos. on the Relability Problem in Information Systems, Leningrad, Part 2, Leningrad: LIAP, 1986, pp. 140\u2013141."},{"issue":"1","key":"4081_CR15","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1109\/TIT.1987.1057276","volume":"35","author":"M. Loeloeian","year":"1987","unstructured":"Loeloeian, M. and Conan, J., A Transform Approach in Goppa Codes, IEEE Trans. Inform. Theory, 1987, vol. 35, no. 1, pp. 105\u2013115.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"4081_CR16","doi-asserted-by":"publisher","first-page":"1130","DOI":"10.1109\/18.135654","volume":"38","author":"A.M. Roseiro","year":"1992","unstructured":"Roseiro, A.M., Hall, J.I., Adney, J.E., and Siegel, M., The Trace Operator and Redundancy of Goppa Codes, IEEE Trans. Inform. Theory, 1992, vol. 38, no. 3, pp. 1130\u20131133.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"4081_CR17","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1109\/18.370170","volume":"41","author":"S.V. Bezzateev","year":"1995","unstructured":"Bezzateev, S.V. and Shekhunova, N.A., Subclass of Binary Goppa Codes with Minimal Distance Equal to the Design Distance, IEEE Trans. Inform. Theory, 1995, vol. 41, no. 2, pp. 554\u2013555.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"4081_CR18","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1023\/A:1011281431366","volume":"24","author":"P. V\u00e9ron","year":"2001","unstructured":"V\u00e9ron, P., True Dimension of Some Binary Quadratic Trace Goppa Codes, Des. Codes Cryptogr., 2001, vol. 24, no. 1, pp. 81\u201397.","journal-title":"Des. Codes Cryptogr."},{"issue":"3","key":"4081_CR19","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s10623-004-1722-4","volume":"36","author":"P. V\u00e9ron","year":"2005","unstructured":"V\u00e9ron, P., Proof of Conjectures on the True Dimension of Some Binary Goppa Codes, Des. Codes Cryptogr., 2005, vol. 36, no. 3, pp. 317\u2013325.","journal-title":"Des. Codes Cryptogr."},{"issue":"2","key":"4081_CR20","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1023\/A:1008327723647","volume":"20","author":"G. Bommier","year":"2000","unstructured":"Bommier, G. and Blanchet, F., Binary Quasi-cyclic Goppa Codes, Des. Codes Cryptogr., 2000, vol. 20, no. 2, pp. 107\u2013124.","journal-title":"Des. Codes Cryptogr."},{"key":"4081_CR21","unstructured":"Maatouk, G., Good Ensembles of Goppa Codes, Semester Project 2006\u20132007, ALGO Lab., \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne, 2007. Available at http:\/\/infoscience.epfl.ch\/record\/101083\/files\/maatouk-report.pdf."}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946010030038.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0032946010030038","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946010030038","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946010030038.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:07:15Z","timestamp":1775009235000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0032946010030038"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["4081"],"URL":"https:\/\/doi.org\/10.1134\/s0032946010030038","relation":{},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9]]},"assertion":[{"value":"4 December 2009","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 May 2010","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 October 2010","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}