{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:33:33Z","timestamp":1775018013771,"version":"3.50.1"},"reference-count":51,"publisher":"Pleiades Publishing Ltd","issue":"1","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023,1]]},"DOI":"10.1134\/s0032946023010039","type":"journal-article","created":{"date-parts":[[2023,8,28]],"date-time":"2023-08-28T07:04:20Z","timestamp":1693206260000},"page":"22-40","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Design and Decoding of Polar Codes with Large Kernels: A Survey"],"prefix":"10.1134","volume":"59","author":[{"given":"P. V.","family":"Trifonov","sequence":"first","affiliation":[]}],"member":"137","published-online":{"date-parts":[[2023,8,28]]},"reference":[{"issue":"7","key":"5071_CR1","doi-asserted-by":"publisher","first-page":"3051","DOI":"10.1109\/TIT.2009.2021379","volume":"55","author":"E. Ar\u0131kan","year":"2009","unstructured":"Ar\u0131kan, E., Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels, IEEE Trans. Inform. Theory, 2009, vol.\u00a055, no.\u00a07, pp.\u00a03051\u20133073. https:\/\/doi.org\/10.1109\/TIT.2009.2021379","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"12","key":"5071_CR2","doi-asserted-by":"publisher","first-page":"6253","DOI":"10.1109\/TIT.2010.2080990","volume":"56","author":"S.B. Korada","year":"2010","unstructured":"Korada, S.B., \u015ea\u015fo\u011flu, E., and Urbanke, R., Polar Codes: Characterization of Exponent, Bounds, and Constructions, IEEE Trans. Inform. Theory, 2010, vol.\u00a056, no.\u00a012, pp.\u00a06253\u20136264. https:\/\/doi.org\/10.1109\/TIT.2010.2080990","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"9","key":"5071_CR3","doi-asserted-by":"publisher","first-page":"5693","DOI":"10.1109\/TIT.2020.3038806","volume":"67","author":"A. Fazeli","year":"2021","unstructured":"Fazeli, A., Hassani, H., Mondelli, M., and Vardy, A., Binary Linear Codes with Optimal Scaling: Polar Codes with Large Kernels, IEEE Trans. Inform. Theory, 2021, vol.\u00a067, no.\u00a09, pp.\u00a05693\u20135710. https:\/\/doi.org\/10.1109\/TIT.2020.3038806","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"5071_CR4","doi-asserted-by":"publisher","first-page":"1478","DOI":"10.1109\/TIT.2020.3041570","volume":"67","author":"H.-P. Wang","year":"2021","unstructured":"Wang, H.-P. and Duursma, I.M., Polar Codes\u2019 Simplicity, Random Codes\u2019 Durability, IEEE Trans. Inform. Theory, 2021, vol.\u00a067, no.\u00a03, pp.\u00a01478\u20131508. https:\/\/doi.org\/10.1109\/TIT.2020.3041570","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"5071_CR5","doi-asserted-by":"publisher","first-page":"2877","DOI":"10.1109\/TIT.2022.3146786","volume":"68","author":"V. Guruswami","year":"2022","unstructured":"Guruswami, V., Riazanov, A., and Ye, M., Ar\u0131kan Meets Shannon: Polar Codes with Near-Optimal Convergence to Channel Capacity, IEEE Trans. Inform. Theory, 2022, vol.\u00a068, no.\u00a05, pp.\u00a02877\u20132919. https:\/\/doi.org\/10.1109\/TIT.2022.3146786","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"5071_CR6","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1109\/JSAC.2015.2504278","volume":"34","author":"N. Presman","year":"2016","unstructured":"Presman, N., Shapira, O., and Litsyn, S., Mixed-Kernels Constructions of Polar Codes, IEEE J. Select. Areas Commun., 2016, vol.\u00a034, no.\u00a02, pp.\u00a0239\u2013253. https:\/\/doi.org\/10.1109\/JSAC.2015.2504278","journal-title":"IEEE J. Select. Areas Commun."},{"issue":"9","key":"5071_CR7","doi-asserted-by":"publisher","first-page":"5350","DOI":"10.1109\/TCOMM.2020.3006212","volume":"68","author":"V. Bioglio","year":"2020","unstructured":"Bioglio, V., Gabry, F., Land, I., and Belfiore, J.-C., Multi-Kernel Polar Codes: Concept and Design Principles, IEEE Trans. Commun., 2020, vol.\u00a068, no.\u00a09, pp.\u00a05350\u20135362. https:\/\/doi.org\/10.1109\/TCOMM.2020.3006212","journal-title":"IEEE Trans. Commun."},{"key":"5071_CR8","doi-asserted-by":"publisher","unstructured":"Trifonov, P., Binary Successive Cancellation Decoding of Polar Codes with Reed\u2013Solomon Kernel, in Proc. 2014 IEEE Int. Symp. on Information Theory (ISIT\u20192014), Honolulu, HI, USA, June 29 \u2013 July 4, 2014, pp.\u00a02972\u20132976. https:\/\/doi.org\/10.1109\/ISIT.2014.6875379","DOI":"10.1109\/ISIT.2014.6875379"},{"key":"5071_CR9","doi-asserted-by":"publisher","unstructured":"Bioglio V., and Land, I., On the Marginalization of Polarizing Kernels, in Proc. 2018 IEEE 10th Int. Symp. on Turbo Codes & Iterative Information Processing (ISTC\u20192018), Hong Kong, China, Dec. 3\u20137, 2018, pp.\u00a01\u20135. https:\/\/doi.org\/10.1109\/ISTC.2018.8625378","DOI":"10.1109\/ISTC.2018.8625378"},{"issue":"5","key":"5071_CR10","doi-asserted-by":"publisher","first-page":"2213","DOI":"10.1109\/TIT.2015.2410251","volume":"61","author":"I. Tal","year":"2015","unstructured":"Tal, I. and Vardy, A., List Decoding of Polar Codes, IEEE Trans. Inform. Theory, 2015, vol.\u00a061, no.\u00a05, pp.\u00a02213\u20132226. https:\/\/doi.org\/10.1109\/TIT.2015.2410251","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"7","key":"5071_CR11","doi-asserted-by":"publisher","first-page":"1127","DOI":"10.1109\/LCOMM.2014.2323237","volume":"18","author":"V. Miloslavskaya","year":"2014","unstructured":"Miloslavskaya, V. and Trifonov, P., Sequential Decoding of Polar Codes, IEEE Commun. Lett., 2014, vol.\u00a018, no.\u00a07, pp.\u00a01127\u20131130. https:\/\/doi.org\/10.1109\/LCOMM.2014.2323237","journal-title":"IEEE Commun. Lett."},{"issue":"6","key":"5071_CR12","doi-asserted-by":"publisher","first-page":"2333","DOI":"10.1109\/TCOMM.2018.2793887","volume":"66","author":"L. Chandesris","year":"2018","unstructured":"Chandesris, L., Savin, V., and Declercq, D., Dynamic-SCFlip Decoding of Polar Codes, IEEE Trans. Commun., 2018, vol.\u00a066, no.\u00a06, pp.\u00a02333\u20132345. https:\/\/doi.org\/10.1109\/TCOMM.2018.2793887","journal-title":"IEEE Trans. Commun."},{"key":"5071_CR13","doi-asserted-by":"publisher","unstructured":"Trifonov, P., A Score Function for Sequential Decoding of Polar Codes, in Proc. 2018 IEEE Int. Symp. on Information Theory (ISIT\u20192018), Vail, CO, USA, June 17\u201322, 2018, pp.\u00a01470\u20131474. https:\/\/doi.org\/10.1109\/ISIT.2018.8437559","DOI":"10.1109\/ISIT.2018.8437559"},{"issue":"5","key":"5071_CR14","doi-asserted-by":"publisher","first-page":"2307","DOI":"10.1109\/TIT.2010.2043769","volume":"56","author":"Y. Polyanskiy","year":"2010","unstructured":"Polyanskiy, Y., Poor, H.V., and Verd\u00fa, S., Channel Coding Rate in the Finite Blocklength Regime, IEEE Trans. Inform. Theory, 2010, vol.\u00a056, no.\u00a05, pp.\u00a02307\u20132359. https:\/\/doi.org\/10.1109\/TIT.2010.2043769","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"12","key":"5071_CR15","doi-asserted-by":"publisher","first-page":"6698","DOI":"10.1109\/TIT.2016.2616117","volume":"62","author":"M. Mondelli","year":"2016","unstructured":"Mondelli, M., Hassani, S.H., and Urbanke, R.L., Unified Scaling of Polar Codes: Error Exponent, Scaling Exponent, Moderate Deviations, and Error Floors, IEEE Trans. Inform. Theory, 2016, vol.\u00a062, no.\u00a012, pp.\u00a06698\u20136712. https:\/\/doi.org\/10.1109\/TIT.2016.2616117","journal-title":"IEEE Trans. Inform. Theory"},{"key":"5071_CR16","doi-asserted-by":"publisher","unstructured":"Fazeli, A. and Vardy, A., On the Scaling Exponent of Binary Polarization Kernels, in Proc. 52nd Annu. Allerton Conf. on Communication, Control, and Computing (Allerton\u20192014), Monticello, IL, USA, Sept. 30\u2013Oct. 3, 2014, pp.\u00a0797\u2013804. https:\/\/doi.org\/10.1109\/ALLERTON.2014.7028536","DOI":"10.1109\/ALLERTON.2014.7028536"},{"key":"5071_CR17","doi-asserted-by":"publisher","unstructured":"Yao, H., Fazeli, A., and Vardy, A., Explicit Polar Codes with Small Scaling Exponent, in Proc. 2019 IEEE Int. Symp. on Information Theory (ISIT\u20192019), Paris, France, July 7\u201312, 2019, pp.\u00a01757\u20131761. https:\/\/doi.org\/10.1109\/ISIT.2019.8849741","DOI":"10.1109\/ISIT.2019.8849741"},{"issue":"5","key":"5071_CR18","doi-asserted-by":"publisher","first-page":"3371","DOI":"10.1109\/TIT.2018.2789885","volume":"64","author":"M. Mondelli","year":"2018","unstructured":"Mondelli, M., Hassani, H., and Urbanke, R., How to Achieve the Capacity of Asymmetric Channels. IEEE Trans. Inform. Theory. 2018, vol.\u00a064, no.\u00a05, pp.\u00a03371\u20133393. https:\/\/doi.org\/10.1109\/TIT.2018.2789885","journal-title":"IEEE Trans. Inform. Theory."},{"issue":"2","key":"5071_CR19","doi-asserted-by":"publisher","first-page":"955","DOI":"10.1109\/TIT.2012.2219035","volume":"59","author":"W. Park","year":"2013","unstructured":"Park, W. and Barg, A., Polar Codes for $q$-ary Channels, $q=2^r$, IEEE Trans. Inform. Theory, 2013, vol.\u00a059, no.\u00a02, pp.\u00a0955\u2013969. https:\/\/doi.org\/10.1109\/TIT.2012.2219035","journal-title":"IEEE Trans. Inform. Theory"},{"key":"5071_CR20","doi-asserted-by":"publisher","unstructured":"\u015ea\u015fo\u011flu, E., Telatar, I.E., and Ar\u0131kan, E., Polarization for Arbitrary Discrete Memoryless Channels, in Proc. IEEE 2009 Information Theory Workshop (ITW\u20192009), Taormina, Italy, Oct. 11\u201316, 2009, pp.\u00a0144\u2013148. https:\/\/doi.org\/10.1109\/ITW.2009.5351487","DOI":"10.1109\/ITW.2009.5351487"},{"issue":"5","key":"5071_CR21","doi-asserted-by":"publisher","first-page":"2720","DOI":"10.1109\/TIT.2014.2312181","volume":"60","author":"R. Mori","year":"2014","unstructured":"Mori, R. and Tanaka, T., Source and Channel Polarization over Finite Fields and Reed\u2013Solomon Matrices, IEEE Trans. Inform. Theory, 2014, vol.\u00a060, no.\u00a05, pp.\u00a02720\u20132736. https:\/\/doi.org\/10.1109\/TIT.2014.2312181","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"5071_CR22","doi-asserted-by":"publisher","first-page":"2227","DOI":"10.1109\/TIT.2015.2409257","volume":"61","author":"N. Presman","year":"2015","unstructured":"Presman, N., Shapira, O., Litsyn, S., Etzion, T., and Vardy, A., Binary Polarization Kernels from Code Decompositions, IEEE Trans. Inform. Theory, 2015, vol.\u00a061, no.\u00a05, pp.\u00a02227\u20132239. https:\/\/doi.org\/10.1109\/TIT.2015.2409257","journal-title":"IEEE Trans. Inform. Theory"},{"key":"5071_CR23","doi-asserted-by":"publisher","unstructured":"Trofimiuk, G. and Trifonov, P., Efficient Decoding of Polar Codes with Some 16 \u00d7 16 Kernels, in Proc. IEEE 2018 Information Theory Workshop (ITW\u20192018), Guangzhou, China, Nov. 25\u201329, 2018, pp.\u00a011\u201315. https:\/\/doi.org\/10.1109\/ITW.2018.8613307","DOI":"10.1109\/ITW.2018.8613307"},{"key":"5071_CR24","doi-asserted-by":"publisher","unstructured":"Trofimiuk, G., A Search Method for Large Polarization Kernels, in Proc. 2021 IEEE Int. Symp. on Information Theory (ISIT\u20192021), Melbourne, Australia, July 12\u201320, 2021, pp.\u00a02084\u20132089. https:\/\/doi.org\/10.1109\/ISIT45174.2021.9517729","DOI":"10.1109\/ISIT45174.2021.9517729"},{"issue":"10","key":"5071_CR25","doi-asserted-by":"publisher","first-page":"5253","DOI":"10.1109\/TIT.2015.2469298","volume":"61","author":"H.-P. Lin","year":"2015","unstructured":"Lin, H.-P., Lin, S., and Abdel-Ghaffar, K.A.S., Linear and Nonlinear Binary Kernels of Polar Codes of Small Dimensions with Maximum Exponents, IEEE Trans. Inform. Theory, 2015, vol.\u00a061, no.\u00a010, pp.\u00a05253\u20135270. https:\/\/doi.org\/10.1109\/TIT.2015.2469298","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"7","key":"5071_CR26","doi-asserted-by":"publisher","first-page":"1383","DOI":"10.1109\/LCOMM.2020.2984382","volume":"24","author":"E. Moskovskaya","year":"2020","unstructured":"Moskovskaya, E. and Trifonov, P., Design of BCH Polarization Kernels with Reduced Processing Complexity, IEEE Commun. Lett., 2020, vol.\u00a024, no.\u00a07, pp.\u00a01383\u20131386. https:\/\/doi.org\/10.1109\/LCOMM.2020.2984382","journal-title":"IEEE Commun. Lett."},{"issue":"11","key":"5071_CR27","doi-asserted-by":"publisher","first-page":"14031","DOI":"10.1109\/TVT.2020.3029305","volume":"69","author":"F. Abbasi","year":"2020","unstructured":"Abbasi, F. and Viterbo, E., Large Kernel Polar Codes with Efficient Window Decoding, in IEEE Trans. Veh. Technol., 2020, vol.\u00a069, no.\u00a011, pp.\u00a014031\u201314036. https:\/\/doi.org\/10.1109\/TVT.2020.3029305","journal-title":"IEEE Trans. Veh. Technol."},{"key":"5071_CR28","doi-asserted-by":"publisher","unstructured":"Trofimiuk, G., Shortened Polarization Kernels, in Proc. 2021 IEEE Globecom Workshops (GC Wkshps), Madrid, Spain, Dec. 7\u201311, 2021, pp.\u00a01\u20136. https:\/\/doi.org\/10.1109\/GCWkshps52748.2021.9681982","DOI":"10.1109\/GCWkshps52748.2021.9681982"},{"key":"5071_CR29","doi-asserted-by":"publisher","unstructured":"Miloslavskaya, V. and Trifonov, P., Sequential Decoding of Polar Codes with Arbitrary Binary Kernel, in Proc. IEEE 2014 Information Theory Workshop (ITW\u20192014), Hobart, TAS, Australia, Nov. 2\u20135, 2014, pp.\u00a0376\u2013380. https:\/\/doi.org\/10.1109\/ITW.2014.6970857","DOI":"10.1109\/ITW.2014.6970857"},{"issue":"2","key":"5071_CR30","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1109\/18.661515","volume":"44","author":"T. Fujiwara","year":"1998","unstructured":"Fujiwara, T., Yamamoto, H., Kasami, T., and Lin, S., A Trellis-Based Recursive Maximum-Likelihood Decoding Algorithm for Binary Linear Block Codes, in IEEE Trans. Inform. Theory, 1998, vol.\u00a044, no.\u00a02, pp.\u00a0714\u2013729. https:\/\/doi.org\/10.1109\/18.661515","journal-title":"IEEE Trans. Inform. Theory"},{"key":"5071_CR31","doi-asserted-by":"publisher","unstructured":"Trifonov, P., Trellis-Based Decoding Techniques for Polar Codes with Large Kernels, in Proc. IEEE 2019 Information Theory Workshop (ITW\u20192019), Visby, Sweden, Aug. 25\u201328, 2019, pp.\u00a0249\u2013253. https:\/\/doi.org\/10.1109\/ITW44776.2019.8989386","DOI":"10.1109\/ITW44776.2019.8989386"},{"key":"5071_CR32","doi-asserted-by":"publisher","unstructured":"Trifonov, P. and Karakchieva, L., Recursive Processing Algorithm for Low Complexity Decoding of Polar Codes with Large Kernels, IEEE Trans. Commun., Early access June 2023, https:\/\/doi.org\/10.1109\/TCOMM.2023.3285773","DOI":"10.1109\/TCOMM.2023.3285773"},{"issue":"19","key":"5071_CR33","doi-asserted-by":"publisher","first-page":"5165","DOI":"10.1109\/TSP.2015.2439211","volume":"63","author":"A. Balatsoukas-Stimming","year":"2015","unstructured":"Balatsoukas-Stimming, A., Bastani Parizi, M., and Burg, A., LLR-Based Successive Cancellation List Decoding of Polar Codes, in IEEE Trans. Signal Process., 2015, vol.\u00a063, no.\u00a019, pp.\u00a05165\u20135179. https:\/\/doi.org\/10.1109\/TSP.2015.2439211","journal-title":"IEEE Trans. Signal Process."},{"issue":"10","key":"5071_CR34","doi-asserted-by":"publisher","first-page":"10988","DOI":"10.1109\/TVT.2020.3006369","volume":"69","author":"G. Trofimiuk","year":"2020","unstructured":"Trofimiuk, G., Iakuba, N., Rets, S., Ivanov, K., and Trifonov, P., Fast Block Sequential Decoding of Polar Codes, in IEEE Trans. Veh. Technol., 2020, vol.\u00a069, no.\u00a010, pp.\u00a010988\u201310999. https:\/\/doi.org\/10.1109\/TVT.2020.3006369","journal-title":"IEEE Trans. Veh. Technol."},{"issue":"7","key":"5071_CR35","doi-asserted-by":"publisher","first-page":"4294","DOI":"10.1109\/TCOMM.2021.3072730","volume":"69","author":"G. Trofimiuk","year":"2021","unstructured":"Trofimiuk, G. and Trifonov, P., Window Processing of Binary Polarization Kernels, IEEE Trans. Commun., 2021, vol.\u00a069, no.\u00a07, pp.\u00a04294\u20134305. https:\/\/doi.org\/10.1109\/TCOMM.2021.3072730","journal-title":"IEEE Trans. Commun."},{"key":"5071_CR36","doi-asserted-by":"publisher","unstructured":"Trofimiuk, G. and Trifonov, P., Construction of Binary Polarization Kernels for Low Complexity Window Processing, in Proc. IEEE 2019 Information Theory Workshop (ITW\u20192019), Visby, Sweden, Aug. 25\u201328, 2019, pp.\u00a0115\u2013119. https:\/\/doi.org\/10.1109\/ITW44776.2019.8989344","DOI":"10.1109\/ITW44776.2019.8989344"},{"issue":"5","key":"5071_CR37","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1109\/TIT.2004.826644","volume":"50","author":"A. Valembois","year":"2004","unstructured":"Valembois, A. and Fossorier, M., Box and Match Techniques Applied to Soft-Decision Decoding, IEEE Trans. Inform. Theory, 2004, vol.\u00a050, no.\u00a05, pp.\u00a0796\u2013810. https:\/\/doi.org\/10.1109\/TIT.2004.826644","journal-title":"IEEE Trans. Inform. Theory"},{"key":"5071_CR38","doi-asserted-by":"publisher","unstructured":"Gupta, B., Yao, H., Fazeli, A., and Vardy, A., Polar List Decoding for Large Polarization Kernels, in Proc. 2021 IEEE Globecom Workshops (GC Wkshps), Madrid, Spain, Dec. 7\u201311, 2021, pp.\u00a01\u20136. https:\/\/doi.org\/10.1109\/GCWkshps52748.2021.9681935","DOI":"10.1109\/GCWkshps52748.2021.9681935"},{"issue":"11","key":"5071_CR39","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.\u00a060, no.\u00a011, pp.\u00a03221\u20133227. https:\/\/doi.org\/10.1109\/TCOMM.2012.081512.110872","journal-title":"IEEE Trans. Commun."},{"issue":"10","key":"5071_CR40","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.\u00a059, no.\u00a010, pp.\u00a06562\u20136582. https:\/\/doi.org\/10.1109\/TIT.2013.2272694","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"7","key":"5071_CR41","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1109\/LCOMM.2009.090428","volume":"13","author":"R. Mori","year":"2009","unstructured":"Mori, R. and Tanaka, T., Performance of Polar Codes with the Construction Using Density Evolution, IEEE Commun. Lett., 2009, vol.\u00a013, no.\u00a07, pp.\u00a0519\u2013521. https:\/\/doi.org\/10.1109\/LCOMM.2009.090428","journal-title":"IEEE Commun. Lett."},{"key":"5071_CR42","doi-asserted-by":"publisher","unstructured":"Kern, D., Vork\u00f6per, S., and K\u00fchn, V., A New Code Construction for Polar Codes Using Min-Sum Density, in Proc. 2014 8th Int. Symp. on Turbo Codes and Iterative Information Processing (ISTC\u20192014), Bremen, Germany, Aug. 18\u201322, 2014, pp.\u00a0228\u2013232. https:\/\/doi.org\/10.1109\/ISTC.2014.6955119","DOI":"10.1109\/ISTC.2014.6955119"},{"key":"5071_CR43","doi-asserted-by":"publisher","unstructured":"Miloslavskaya, V. and Trifonov, P., Design of Binary Polar Codes with Arbitrary Kernels, in Proc. 2012 IEEE Information Theory Workshop (ITW\u20192012), Lausanne, Switzerland, Sept. 3\u20137, 2012, pp.\u00a0119\u2013123. https:\/\/doi.org\/10.1109\/ITW.2012.6404639","DOI":"10.1109\/ITW.2012.6404639"},{"key":"5071_CR44","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338","volume-title":"Modern Coding Theory","author":"T. Richardson","year":"2008","unstructured":"Richardson, T. and Urbanke, R., Modern Coding Theory, Cambridge, UK: Cambridge Univ. Press, 2008."},{"key":"5071_CR45","doi-asserted-by":"publisher","unstructured":"Trifonov, P., On Construction of Polar Subcodes with Large Kernels, in Proc. 2019 IEEE Int. Symp. on Information Theory (ISIT\u20192019), Paris, France, July 7\u201312, 2019, pp.\u00a01932\u20131936. https:\/\/doi.org\/10.1109\/ISIT.2019.8849672","DOI":"10.1109\/ISIT.2019.8849672"},{"issue":"9","key":"5071_CR46","doi-asserted-by":"publisher","first-page":"1857","DOI":"10.1109\/LCOMM.2020.2995257","volume":"24","author":"L. Karakchieva","year":"2020","unstructured":"Karakchieva, L. and Trifonov, P., An Approximate Method for Construction of Polar Codes with Kernels over $\\mathbb{F}_2^t$, IEEE Commun. Lett., 2020, vol.\u00a024, no.\u00a09, pp.\u00a01857\u20131860. https:\/\/doi.org\/10.1109\/LCOMM.2020.2995257","journal-title":"IEEE Commun. Lett."},{"issue":"2","key":"5071_CR47","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1109\/JSAC.2015.2504269","volume":"34","author":"P. Trifonov","year":"2016","unstructured":"Trifonov, P. and Miloslavskaya, V., Polar Subcodes, IEEE J. Select. Areas Commun., 2016, vol.\u00a034, no.\u00a02, pp.\u00a0254\u2013266. https:\/\/doi.org\/10.1109\/JSAC.2015.2504269","journal-title":"IEEE J. Select. Areas Commun."},{"issue":"11","key":"5071_CR48","doi-asserted-by":"publisher","first-page":"6714","DOI":"10.1109\/TCOMM.2020.3018781","volume":"68","author":"P. Trifonov","year":"2020","unstructured":"Trifonov, P., Randomized Polar Subcodes with Optimized Error Coefficient, IEEE Trans. Commun., 2020, vol.\u00a068, no.\u00a011, pp.\u00a06714\u20136722. https:\/\/doi.org\/10.1109\/TCOMM.2020.3018781","journal-title":"IEEE Trans. Commun."},{"key":"5071_CR49","doi-asserted-by":"publisher","unstructured":"Trifonov, P. and Trofimiuk, G., A Randomized Construction of Polar Subcodes, in Proc. 2017 IEEE Int. Symp. on Information Theory (ISIT\u20192017), Aachen, Germany, June 25\u201330, 2017, pp.\u00a01863\u20131867. https:\/\/doi.org\/10.1109\/ISIT.2017.8006852","DOI":"10.1109\/ISIT.2017.8006852"},{"issue":"12","key":"5071_CR50","doi-asserted-by":"publisher","first-page":"7945","DOI":"10.1109\/TCOMM.2021.3111625","volume":"69","author":"V. Miloslavskaya","year":"2021","unstructured":"Miloslavskaya, V., Vucetic, B., Li, Y., Park, G., and Park, O.-S., Recursive Design of Precoded Polar Codes For SCL Decoding, IEEE Trans. Commun., 2021, vol.\u00a069, no.\u00a012, pp.\u00a07945\u20137959. https:\/\/doi.org\/10.1109\/TCOMM.2021.3111625","journal-title":"IEEE Trans. Commun."},{"key":"5071_CR51","doi-asserted-by":"publisher","unstructured":"Trifonov, P., Recursive Trellis Processing of Large Polarization Kernels, in Proc. 2021 IEEE Int. Symp. on Information Theory (ISIT\u20192021), Melbourne, Australia, July 12\u201320, 2021, pp.\u00a02090\u20132095. https:\/\/doi.org\/10.1109\/ISIT45174.2021.9517783","DOI":"10.1109\/ISIT45174.2021.9517783"}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946023010039.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0032946023010039","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946023010039.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:49:27Z","timestamp":1775011767000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0032946023010039"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1]]},"references-count":51,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["5071"],"URL":"https:\/\/doi.org\/10.1134\/s0032946023010039","relation":{"is-translation-of":[{"id-type":"doi","id":"10.31857\/S0555292323010035","asserted-by":"subject"}]},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1]]},"assertion":[{"value":"29 December 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 February 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 February 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 August 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}