{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T03:38:27Z","timestamp":1775014707475,"version":"3.50.1"},"reference-count":15,"publisher":"Pleiades Publishing Ltd","issue":"4","license":[{"start":{"date-parts":[[2014,10,1]],"date-time":"2014-10-01T00:00:00Z","timestamp":1412121600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,10,1]],"date-time":"2014-10-01T00:00:00Z","timestamp":1412121600000},"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":[[2014,10]]},"DOI":"10.1134\/s0032946014040012","type":"journal-article","created":{"date-parts":[[2015,1,6]],"date-time":"2015-01-06T08:18:10Z","timestamp":1420532290000},"page":"303-312","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Successive cancellation decoding of Reed-Solomon codes"],"prefix":"10.1134","volume":"50","author":[{"given":"P. V.","family":"Trifonov","sequence":"first","affiliation":[]}],"member":"137","published-online":{"date-parts":[[2015,1,7]]},"reference":[{"issue":"11","key":"4208_CR1","doi-asserted-by":"publisher","first-page":"2809","DOI":"10.1109\/TIT.2003.819332","volume":"49","author":"R Koetter","year":"2003","unstructured":"Koetter, R. and Vardy, A., Algebraic Soft-Decision Decoding of Reed-Solomon Codes, IEEE Trans. Inform. Theory, 2003, vol. 49, no. 11, pp. 2809\u20132825.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"4208_CR2","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1109\/JSAC.2005.862399","volume":"24","author":"M El-Khamy","year":"2006","unstructured":"El-Khamy, M. and McEliece, R., Iterative Algebraic Soft-Decision List Decoding of Reed-Solomon Codes, IEEE J. Select. Areas Commun., 2006, vol. 24, no. 3, pp. 481\u2013490.","journal-title":"IEEE J. Select. Areas Commun."},{"issue":"3","key":"4208_CR3","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1109\/26.79287","volume":"39","author":"A Vardy","year":"1991","unstructured":"Vardy, A. and Beery, Y., Bit-Level Soft-Decision Decoding of Reed-Solomon Codes, IEEE Trans. Commun., 1991, vol. 39, no. 3, pp. 440\u2013444.","journal-title":"IEEE Trans. Commun."},{"issue":"3","key":"4208_CR4","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1109\/TIT.2009.2039091","volume":"56","author":"J Bellorado","year":"2010","unstructured":"Bellorado, J., Kav\u010di\u0107, A., Marrow, M., and Ping, L., Low-Complexity Soft-Decoding Algorithms for Reed-Solomon Codes\u2014Part II: Soft-Input Soft-Output Iterative Decoding, IEEE Trans. Inform. Theory, 2010, vol. 56, no. 3, pp. 960\u2013967.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"7","key":"4208_CR5","doi-asserted-by":"publisher","first-page":"3051","DOI":"10.1109\/TIT.2009.2021379","volume":"55","author":"E Arikan","year":"2009","unstructured":"Arikan, E., Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels, IEEE Trans. Inform. Theory, 2009, vol. 55, no. 7, pp. 3051\u20133073.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4208_CR6","doi-asserted-by":"crossref","unstructured":"Tal, I. and Vardy, A., List Decoding of Polar Codes, in Proc. 2011 IEEE Int. Sympos. on Information Theory (ISIT\u20192011), St. Petersburg, Russia, July 31\u2013August 5, 2011, pp. 1\u20135.","DOI":"10.1109\/ISIT.2011.6033904"},{"issue":"8","key":"4208_CR7","doi-asserted-by":"publisher","first-page":"3100","DOI":"10.1109\/TCOMM.2013.070213.120789","volume":"61","author":"K Chen","year":"2013","unstructured":"Chen, K., Niu, K., and Lin, J., Improved Successive Cancellation Decoding of Polar Codes, IEEE Trans. Commun., 2013, vol. 61, no. 8, pp. 3100\u20133107.","journal-title":"IEEE Trans. Commun."},{"key":"4208_CR8","doi-asserted-by":"crossref","unstructured":"Trifonov, P. and Miloslavskaya, V., Polar Codes with Dynamic Frozen Symbols and Their Decoding by Directed Search, in Proc. 2013 IEEE Information Theory Workshop (ITW\u20192013), Sevilla, Spain, Sept. 9\u201313, 2013, pp. 1\u20135.","DOI":"10.1109\/ITW.2013.6691213"},{"issue":"4","key":"4208_CR9","first-page":"20","volume":"4","author":"VD Kolesnik","year":"1968","unstructured":"Kolesnik, V.D. and Mironchikov, E.T., Cyclic Reed-Muller Codes and Their Decoding, Probl. Peredachi Inf., 1968, vol. 4, no. 4, pp. 20\u201325 [Probl. Inf. Trans. (Engl. Transl.), 1968, vol. 4, no. 4, pp. 15\u201319].","journal-title":"Probl. Peredachi Inf."},{"issue":"2","key":"4208_CR10","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1109\/TIT.1968.1054127","volume":"14","author":"T Kasami","year":"1968","unstructured":"Kasami, T., Lin, S., and Peterson, W., New Generalizations of the Reed-Muller Codes. I: Primitive Codes, IEEE Trans. Inform. Theory, 1968, vol. 14, no. 2, pp. 189\u2013199.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"4208_CR11","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1109\/TCOMM.2007.894088","volume":"55","author":"D Declercq","year":"2007","unstructured":"Declercq, D. and Fossorier, M.P., Decoding Algorithms for Nonbinary LDPC Codes over GF(q), IEEE Trans. Commun., 2007, vol. 55, no. 4, pp. 633\u2013643.","journal-title":"IEEE Trans. Commun."},{"issue":"10","key":"4208_CR12","doi-asserted-by":"publisher","first-page":"6562","DOI":"10.1109\/TIT.2013.2272694","volume":"59","author":"I Tal","year":"2013","unstructured":"Tal, I. and Vardy, A., How to Construct Polar Codes, IEEE Trans. Inform. Theory, 2013, vol. 59, no. 10, pp. 6562\u20136582.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"4208_CR13","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1109\/18.910580","volume":"47","author":"S-Y Chung","year":"2001","unstructured":"Chung, S.-Y., Richardson, T.J., and Urbanke, R.L., Analysis of Sum-Product Decoding of Low-Density Parity-Check Codes Using a Gaussian Approximation, IEEE Trans. Inform. Theory, 2001, vol. 47, no. 2, pp. 657\u2013670.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"11","key":"4208_CR14","doi-asserted-by":"publisher","first-page":"3221","DOI":"10.1109\/TCOMM.2012.081512.110872","volume":"60","author":"P Trifonov","year":"2012","unstructured":"Trifonov, P., Efficient Design and Decoding of Polar Codes, IEEE Trans. Commun., 2012, vol. 60, no. 11, pp. 3221\u20133227.","journal-title":"IEEE Trans. Commun."},{"issue":"8","key":"4208_CR15","doi-asserted-by":"publisher","first-page":"5437","DOI":"10.1109\/TIT.2012.2201374","volume":"58","author":"E Abbe","year":"2012","unstructured":"Abbe, E. and Telatar, E., Polar Codes for the m-User Multiple Access Channel, IEEE Trans. Inform. Theory, 2012, vol. 58, no. 8, pp. 5437\u20135448.","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946014040012.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0032946014040012","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946014040012","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946014040012.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:20:56Z","timestamp":1775010056000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0032946014040012"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["4208"],"URL":"https:\/\/doi.org\/10.1134\/s0032946014040012","relation":{},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10]]},"assertion":[{"value":"30 December 2013","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 August 2014","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 2015","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}