{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T03:37:41Z","timestamp":1775014661768,"version":"3.50.1"},"reference-count":12,"publisher":"Pleiades Publishing Ltd","issue":"4","license":[{"start":{"date-parts":[[2012,10,1]],"date-time":"2012-10-01T00:00:00Z","timestamp":1349049600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,10,1]],"date-time":"2012-10-01T00:00:00Z","timestamp":1349049600000},"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":[[2012,10]]},"DOI":"10.1134\/s0032946012040023","type":"journal-article","created":{"date-parts":[[2013,1,23]],"date-time":"2013-01-23T02:53:33Z","timestamp":1358909613000},"page":"324-333","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Asymptotic single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff"],"prefix":"10.1134","volume":"48","author":[{"given":"J. H.","family":"Weber","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. R.","family":"Sidorenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Senger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K. A. S.","family":"Abdel-Ghaffar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2013,1,24]]},"reference":[{"issue":"2","key":"4151_CR1","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1109\/TIT.1966.1053873","volume":"12","author":"G.D. Forney Jr.","year":"1966","unstructured":"Forney, G.D., Jr., Generalized Minimum Distance Decoding, IEEE Trans. Inform. Theory, 1966, vol. 12, no. 2, pp. 125\u2013131.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4151_CR2","volume-title":"Concatenated Codes","author":"G.D. Forney Jr.","year":"1966","unstructured":"Forney, G.D., Jr., Concatenated Codes, Cambridge: MIT Press, 1966. Translated under the title Kaskadnye kody, Moscow: Mir, 1970."},{"issue":"3","key":"4151_CR3","first-page":"35","volume":"22","author":"S.I. Kovalev","year":"1986","unstructured":"Kovalev, S.I., Two Classes of Minimum Generalized Distance Decoding Algorithms, Probl. Peredachi Inf., 1986, vol. 22, no. 3, pp. 35\u201342 [Probl. Inf. Trans. (Engl. Transl.), 1986, vol. 22, no. 3, pp. 186\u2013192].","journal-title":"Probl. Peredachi Inf."},{"issue":"4","key":"4151_CR4","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1109\/TIT.2003.809504","volume":"49","author":"J.H. Weber","year":"2003","unstructured":"Weber, J.H. and Abdel-Ghaffar, K.A.S., Reduced GMD Decoding, IEEE Trans. Inform. Theory, 2003, vol. 49, no. 4, pp. 1013\u20131027.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4151_CR5","doi-asserted-by":"crossref","unstructured":"Sidorenko, V.R., Chaaban, A., Senger, C., and Bossert, M., On Extended Forney-Kovalev GMD Decoding, in Proc. 2009 IEEE Int. Sympos. on Information Theory (ISIT\u20192009), Seoul, Korea, 2009, pp. 1393\u20131397.","DOI":"10.1109\/ISIT.2009.5205900"},{"issue":"1","key":"4151_CR6","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1006\/jcom.1997.0439","volume":"13","author":"M. Sudan","year":"1997","unstructured":"Sudan, M., Decoding of Reed Solomon Codes beyond the Error-Correction Bound, J. Complexity, 1997, vol. 13, no. 1, pp. 180\u2013193.","journal-title":"J. Complexity"},{"issue":"6","key":"4151_CR7","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1109\/18.782097","volume":"45","author":"V. Guruswami","year":"1999","unstructured":"Guruswami, V. and Sudan, M., Improved Decoding of Reed-Solomon and Algebraic-Geometry Codes, IEEE Trans. Inform. Theory, 1999, vol. 45, no. 6, pp. 1757\u20131767.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"7","key":"4151_CR8","doi-asserted-by":"publisher","first-page":"2991","DOI":"10.1109\/TIT.2009.2021308","volume":"55","author":"G. Schmidt","year":"2009","unstructured":"Schmidt, G., Sidorenko, V.R., and Bossert, M., Collaborative Decoding of Interleaved Reed-Solomon Codes and Concatenated Code Designs, IEEE Trans. Inform. Theory, 2009, vol. 55, no. 7, pp. 2991\u20133012.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"4151_CR9","doi-asserted-by":"publisher","first-page":"49","DOI":"10.3934\/amc.2010.4.49","volume":"4","author":"V. Sidorenko","year":"2010","unstructured":"Sidorenko, V., Senger, C., Bossert, M., and Zyablov, V., Single-Trial Decoding of Concatenated Codes Using Fixed or Adaptive Erasing, Adv. Math. Commun., 2010, vol. 4, no. 1, pp. 49\u201360.","journal-title":"Adv. Math. Commun."},{"key":"4151_CR10","doi-asserted-by":"crossref","unstructured":"Senger, C., Sidorenko, V.R., Bossert, M., and Zyablov, V.V., Optimal Thresholds for GMD Decoding with (\u03bb+1)\/\u03bb-Extended Bounded Distance Decoders, in Proc. 2010 IEEE Int. Sympos. on Information Theory (ISIT\u20192010), Austin, TX, USA, 2010, pp. 1100\u20131104.","DOI":"10.1109\/ISIT.2010.5513698"},{"issue":"2","key":"4151_CR11","first-page":"30","volume":"46","author":"C. Senger","year":"2010","unstructured":"Senger, C., Sidorenko, V.R., Bossert, M., and Zyablov, V.V., Multi-Trial Decoding of Concatenated Codes Using Fixed Thresholds, Probl. Peredachi Inf., 2010, vol. 46, no. 2, pp. 30\u201346 [Probl. Inf. Trans. (Engl. Transl.), 2010, vol. 46, no. 2, pp. 127\u2013141].","journal-title":"Probl. Peredachi Inf."},{"key":"4151_CR12","doi-asserted-by":"crossref","unstructured":"Senger, C., Sidorenko, V.R., Bossert, M., and Zyablov, V.V., Optimal Threshold-Based Multi-Trial Error\/Erasure Decoding with the Guruswami-Sudan Algorithm, in Proc. 2011 IEEE Int. Sympos. on Information Theory (ISIT\u20192011), St. Petersburg, Russia, 2011, pp. 845\u2013849.","DOI":"10.1109\/ISIT.2011.6034255"}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946012040023.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0032946012040023","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946012040023","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946012040023.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:20:31Z","timestamp":1775010031000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0032946012040023"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["4151"],"URL":"https:\/\/doi.org\/10.1134\/s0032946012040023","relation":{},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10]]},"assertion":[{"value":"23 April 2012","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 October 2012","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 January 2013","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}