{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:46:53Z","timestamp":1775018813038,"version":"3.50.1"},"reference-count":54,"publisher":"Pleiades Publishing Ltd","issue":"4","license":[{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"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":[[2024,12]]},"DOI":"10.1134\/s0032946024040033","type":"journal-article","created":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T13:42:52Z","timestamp":1738417372000},"page":"304-326","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Design of Polar Codes with Large Kernels"],"prefix":"10.1134","volume":"60","author":[{"given":"P. V.","family":"Trifonov","sequence":"first","affiliation":[]},{"given":"G. A.","family":"Trofimiuk","sequence":"additional","affiliation":[]}],"member":"137","published-online":{"date-parts":[[2025,2,1]]},"reference":[{"issue":"7","key":"5107_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"},{"key":"5107_CR2","doi-asserted-by":"crossref","unstructured":"Marshakov, E., Balitskiy, G., Andreev, K., and Frolov, A., A Polar Code Based Unsourced Random Access for the Gaussian MAC, in Proc. 2019 IEEE 90th Vehicular Technology Conf. (VTC2019-Fall), Honolulu, HI, USA, Sept.\u00a022\u201325, 2019, pp.\u00a01\u20135. https:\/\/doi.org\/10.1109\/VTCFall.2019.8891583","DOI":"10.1109\/VTCFall.2019.8891583"},{"issue":"8","key":"5107_CR3","doi-asserted-by":"publisher","first-page":"1301","DOI":"10.1109\/LCOMM.2019.2922633","volume":"23","author":"Z. Xie","year":"2019","unstructured":"Xie, Z., Chen, P., Mei, Z., Long, S., Cai, K., and Fang, Y., Polar-Coded Physical Layer Network Coding Over Two-Way Relay Channels, IEEE Commun. Lett., 2019, vol.\u00a023, no.\u00a08, pp.\u00a01301\u20131305. https:\/\/doi.org\/10.1109\/LCOMM.2019.2922633","journal-title":"IEEE Commun. Lett."},{"issue":"8","key":"5107_CR4","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1109\/LCOMM.2010.08.100875","volume":"14","author":"M. Andersson","year":"2010","unstructured":"Andersson, M., Rathi, V., Thobaben, R., Kliewer, J., and Skoglund, M., Nested Polar Codes for Wiretap and Relay Channels, IEEE Commun. Lett., 2010, vol.\u00a014, no.\u00a08, pp.\u00a0752\u2013754. https:\/\/doi.org\/10.1109\/LCOMM.2010.08.100875","journal-title":"IEEE Commun. Lett."},{"issue":"5","key":"5107_CR5","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":"2","key":"5107_CR6","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."},{"key":"5107_CR7","doi-asserted-by":"crossref","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"},{"key":"5107_CR8","doi-asserted-by":"crossref","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"},{"key":"5107_CR9","doi-asserted-by":"crossref","unstructured":"Miloslavskaya, V. and Trifonov, P., Sequential Decoding of Polar Codes with Arbitrary Binary Kernel, in Proc. IEEE 2014 Information Theory Workshop (ITW 2014), Hobart, TAS, Australia, Nov.\u00a02\u20135, 2014, pp.\u00a0376\u2013380. https:\/\/doi.org\/10.1109\/ITW.2014.6970857","DOI":"10.1109\/ITW.2014.6970857"},{"issue":"5","key":"5107_CR10","doi-asserted-by":"publisher","DOI":"10.3390\/app14051847","volume":"14","author":"I. Timokhin","year":"2024","unstructured":"Timokhin, I. and Ivanov, F., Sequential Polar Decoding with Cost Metric Threshold, Appl. Sci., 2024, vol.\u00a014, no.\u00a05, Paper No.\u00a01847 (13\u00a0pp.). https:\/\/doi.org\/10.3390\/app14051847","journal-title":"Appl. Sci."},{"issue":"12","key":"5107_CR11","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"},{"key":"5107_CR12","doi-asserted-by":"crossref","unstructured":"Mori, R. and Tanaka, T., Channel Polarization on $q$-ary Discrete Memoryless Channels by Arbitrary Kernels, in Proc. 2010 IEEE Int. Sympos. on Information Theory (ISIT 2010), Austin, TX, USA, June 13\u201318, 2010, pp.\u00a0894\u2013898. https:\/\/doi.org\/10.1109\/ISIT.2010.5513568","DOI":"10.1109\/ISIT.2010.5513568"},{"key":"5107_CR13","doi-asserted-by":"crossref","unstructured":"Pfister, H.D. and Urbanke, R.L., Near-Optimal Finite-Length Scaling for Polar Codes over large alphabets, in Proc. 2016 IEEE Int. Symp. on Information Theory (ISIT 2016), Barcelona, Spain, July 10\u201315, 2016, pp.\u00a0215\u2013219. https:\/\/doi.org\/10.1109\/ISIT.2016.7541292","DOI":"10.1109\/ISIT.2016.7541292"},{"issue":"9","key":"5107_CR14","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":"7","key":"5107_CR15","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."},{"issue":"7","key":"5107_CR16","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."},{"issue":"10","key":"5107_CR17","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":"11","key":"5107_CR18","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."},{"key":"5107_CR19","unstructured":"Vangala, H., Viterbo, E., and Hong, Y., A Comparative Study of Polar Code Constructions for the AWGN Channel, https:\/\/arxiv.org\/abs\/1501.02473 [cs.IT], 2015."},{"issue":"9","key":"5107_CR20","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":"5107_CR21","doi-asserted-by":"crossref","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.\u00a03\u20137, 2012, pp.\u00a0119\u2013123. https:\/\/doi.org\/10.1109\/ITW.2012.6404639","DOI":"10.1109\/ITW.2012.6404639"},{"issue":"4","key":"5107_CR22","first-page":"20","volume":"60","author":"P.V. Trifonov","year":"2024","unstructured":"Trifonov, P.V. and Trofimiuk, G.A., Design of Polar Codes with Large Binary Kernels, Probl. Peredachi Inf., 2024, vol.\u00a060, no.\u00a04, pp.\u00a020\u201343. https:\/\/doi.org\/10.31857\/S0555292324040028","journal-title":"Probl. Peredachi Inf."},{"issue":"2","key":"5107_CR23","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."},{"key":"5107_CR24","doi-asserted-by":"crossref","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.\u00a03\u20137, 2018, pp.\u00a01\u20135. https:\/\/doi.org\/10.1109\/ISTC.2018.8625378","DOI":"10.1109\/ISTC.2018.8625378"},{"key":"5107_CR25","doi-asserted-by":"crossref","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"},{"issue":"3","key":"5107_CR26","first-page":"20","volume":"38","author":"H. Griesser","year":"2002","unstructured":"Griesser, H. and Sidorenko, V.R., A Posteriory Probability Decoding of Nonsystematically Encoded Block Codes, Probl. Peredachi Inf., 2002, vol.\u00a038, no.\u00a03, pp.\u00a020\u201333 [Probl. Inf. Transm. (Engl. Transl.), 2002, vol.\u00a038, no.\u00a03, pp.\u00a0182\u2013193]. https:\/\/doi.org\/10.1023\/A:1020309101422","journal-title":"Probl. Peredachi Inf."},{"key":"5107_CR27","doi-asserted-by":"crossref","unstructured":"Trifonov, P., Algebraic Matching Techniques for Fast Decoding of Polar Codes with Reed\u2013Solomon Kernel, in Proc. 2018 IEEE Int. Symp. on Information Theory (ISIT 2018), Vail, CO, USA, June 17\u201322, 2018, pp.\u00a01475\u20131479. https:\/\/doi.org\/10.1109\/ISIT.2018.8437829","DOI":"10.1109\/ISIT.2018.8437829"},{"key":"5107_CR28","doi-asserted-by":"publisher","first-page":"26707","DOI":"10.1109\/ACCESS.2018.2834465","volume":"6","author":"Z. Huang","year":"2018","unstructured":"Huang, Z., Zhang, S., Zhang, F., Duanmu, C., Zhong, F., and Chen, M., Simplified Successive Cancellation Decoding of Polar Codes With Medium-Dimensional Binary Kernels, IEEE Access, 2018, vol.\u00a06, pp.\u00a026707\u201326717. https:\/\/doi.org\/10.1109\/ACCESS.2018.2834465","journal-title":"IEEE Access"},{"issue":"9","key":"5107_CR29","doi-asserted-by":"publisher","first-page":"5039","DOI":"10.1109\/TCOMM.2023.3285773","volume":"71","author":"P. Trifonov","year":"2023","unstructured":"Trifonov, P. and Karakchieva, L., Recursive Processing Algorithm for Low Complexity Decoding of Polar Codes with Large Kernels, IEEE Trans. Commun., 2023, vol.\u00a071, no.\u00a09, pp.\u00a05039\u20135050. https:\/\/doi.org\/10.1109\/TCOMM.2023.3285773","journal-title":"IEEE Trans. Commun."},{"issue":"1","key":"5107_CR30","first-page":"25","volume":"59","author":"P. Trifonov","year":"2023","unstructured":"Trifonov, P., Design and Decoding of Polar Codes with Large Kernels: A Survey, Probl. Peredachi Inf., 2023, vol.\u00a059, no.\u00a01, pp.\u00a025\u201345 [Probl. Inf. Transm. (Engl. Transl.), 2023, vol.\u00a059, no.\u00a01, pp.\u00a022\u201340]. https:\/\/doi.org\/10.1134\/S0032946023010039","journal-title":"Probl. Peredachi Inf."},{"issue":"4","key":"5107_CR31","doi-asserted-by":"publisher","first-page":"2201","DOI":"10.1109\/TIT.2012.2233271","volume":"59","author":"A. Guillen i Fabregas","year":"2013","unstructured":"Guillen i Fabregas, A., Land, I., and Martinez, A., Extremes of Error Exponents, IEEE Trans. Inform. Theory, 2013, vol.\u00a059, no.\u00a04, pp.\u00a02201\u20132207. https:\/\/doi.org\/10.1109\/TIT.2012.2233271","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"5107_CR32","first-page":"3","volume":"59","author":"S.G. Kolesnikov","year":"2023","unstructured":"Kolesnikov, S.G. and Leontiev, V.M., Series of Formulas for Bhattacharyya Parameters in the Theory of Polar Codes, Probl. Peredachi Inf., 2023, vol.\u00a059, no.\u00a01, pp.\u00a03\u201316 [Probl. Inf. Transm. (Engl. Transl.), 2023, vol.\u00a059, no.\u00a01, pp.\u00a01\u201313]. https:\/\/doi.org\/10.1134\/S0032946023010015","journal-title":"Probl. Peredachi Inf."},{"key":"5107_CR33","doi-asserted-by":"crossref","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.\u00a030\u2013Oct.\u00a03, 2014, pp.\u00a0797\u2013804. https:\/\/doi.org\/10.1109\/ALLERTON.2014.7028536","DOI":"10.1109\/ALLERTON.2014.7028536"},{"key":"5107_CR34","doi-asserted-by":"crossref","unstructured":"Ashikhmin, A. and Trifonov, P., Efficient Evaluation of Polarization Behavior for Large Kernels, in Proc. 2023 IEEE Int. Symp. on Information Theory (ISIT 2023), Taipei, Taiwan, June 25\u201330, 2023, pp.\u00a01717\u20131722. https:\/\/doi.org\/10.1109\/ISIT54713.2023.10206496","DOI":"10.1109\/ISIT54713.2023.10206496"},{"key":"5107_CR35","doi-asserted-by":"crossref","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"},{"key":"5107_CR36","doi-asserted-by":"crossref","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.\u00a018\u201322, 2014, pp.\u00a0228\u2013232. https:\/\/doi.org\/10.1109\/ISTC.2014.6955119","DOI":"10.1109\/ISTC.2014.6955119"},{"key":"5107_CR37","doi-asserted-by":"crossref","unstructured":"Zhou, Y., Li, R., Zhang, H., Luo, H., and Wang, J., Polarization Weight Family Methods for Polar Code Construction, in Proc. 2018 IEEE 87th Vehicular Technology Conf. (VTC Spring), Porto, Portugal, June 3\u20136, 2018, pp.\u00a01\u20135. https:\/\/doi.org\/10.1109\/VTCSpring.2018.8417498","DOI":"10.1109\/VTCSpring.2018.8417498"},{"key":"5107_CR38","doi-asserted-by":"crossref","unstructured":"Hussami, N., Korada, S.B., and Urbanke, R., Performance of Polar Codes for Channel and Source Coding, in Proc. 2009 IEEE Int. Symp. on Information Theory (ISIT 2009), Seoul, Korea, June 28 \u2013 July 3, 2009, pp.\u00a01488\u20131492. https:\/\/doi.org\/10.1109\/ISIT.2009.5205860","DOI":"10.1109\/ISIT.2009.5205860"},{"issue":"11","key":"5107_CR39","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."},{"issue":"3","key":"5107_CR40","doi-asserted-by":"publisher","first-page":"1257","DOI":"10.1109\/TCOMM.2023.3331532","volume":"72","author":"V. Miloslavskaya","year":"2024","unstructured":"Miloslavskaya, V., Li, Y., and Vucetic, B., Design of Compactly Specified Polar Codes With Dynamic Frozen Bits Based on Reinforcement Learning, IEEE Trans. Commun., 2024, vol.\u00a072, no.\u00a03, pp.\u00a01257\u20131272. https:\/\/doi.org\/10.1109\/TCOMM.2023.3331532","journal-title":"IEEE Trans. Commun."},{"key":"5107_CR41","doi-asserted-by":"crossref","unstructured":"Oreshin, M. and Trifonov, P., Polar Subcodes with Improved Weight Spectrum, in 2024 IEEE Int. Multi-Conf. on Engineering, Computer and Information Sciences (SIBIRCON), Novosibirsk, Russian Federation, Sept.\u00a030 \u2013 Oct.\u00a02, 2024, pp.\u00a041\u201346. https:\/\/doi.org\/10.1109\/SIBIRCON63777.2024.10758477","DOI":"10.1109\/SIBIRCON63777.2024.10758477"},{"key":"5107_CR42","doi-asserted-by":"crossref","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"},{"key":"5107_CR43","doi-asserted-by":"crossref","unstructured":"Kann, T., Kudekar, S., and Bloch, M.R., A Path Metric Based Construction of Polarization-Adjusted Convolutional Codes, in Proc. 2024 IEEE Int. Symp. on Information Theory (ISIT 2024), Athens, Greece, July 7\u201312, 2024, pp.\u00a02406\u20132411. https:\/\/doi.org\/10.1109\/ISIT57864.2024.10619693","DOI":"10.1109\/ISIT57864.2024.10619693"},{"issue":"12","key":"5107_CR44","doi-asserted-by":"publisher","first-page":"7627","DOI":"10.1109\/TIT.2023.3319015","volume":"69","author":"M. Rowshan","year":"2023","unstructured":"Rowshan, M., Dau, S.H., and Viterbo, E., On the Formation of Min-Weight Codewords of Polar\/PAC Codes and Its Applications, IEEE Trans. Inform. Theory, 2023, vol.\u00a069, no.\u00a012, pp.\u00a07627\u20137649. https:\/\/doi.org\/10.1109\/TIT.2023.3319015","journal-title":"IEEE Trans. Inform. Theory"},{"key":"5107_CR45","doi-asserted-by":"crossref","unstructured":"Sun, H., Viterbo, E., and Liu, R., Analysis of Polarization-adjusted Convolutional Codes (PAC): A Source-Channel Coding Method, in Proc. 2021 IEEE Globecom Workshops (GC Wkshps), Madrid, Spain, Dec.\u00a07\u201311, 2021, pp.\u00a01\u20136. https:\/\/doi.org\/10.1109\/GCWkshps52748.2021.9682079","DOI":"10.1109\/GCWkshps52748.2021.9682079"},{"issue":"1","key":"5107_CR46","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1109\/18.567656","volume":"43","author":"J.T. Coffey","year":"1997","unstructured":"Coffey, J.T. and Kiely, A.B., The Capacity of Coded Systems, IEEE Trans. Inform. Theory, 1997, vol.\u00a043, no.\u00a01, pp.\u00a0113\u2013127. https:\/\/doi.org\/10.1109\/18.567656","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"5107_CR47","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1109\/18.651018","volume":"44","author":"S.J. MacMullan","year":"1998","unstructured":"MacMullan, S.J. and Collins, O.M., The Capacity of Binary Channels That Use Linear Codes and Decoders, IEEE Trans. Inform. Theory, 1998, vol.\u00a044, no.\u00a01, pp.\u00a0197\u2013214. https:\/\/doi.org\/10.1109\/18.651018","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"10","key":"5107_CR48","doi-asserted-by":"publisher","first-page":"1727","DOI":"10.1109\/26.957394","volume":"49","author":"S. ten Brink","year":"2001","unstructured":"ten Brink, S., Convergence Behavior of Iteratively Decoded Parallel Concatenated Codes, IEEE Trans. Commun., 2001, vol.\u00a049, no.\u00a010, pp.\u00a01727\u20131737. https:\/\/doi.org\/10.1109\/26.957394","journal-title":"IEEE Trans. Commun."},{"key":"5107_CR49","doi-asserted-by":"crossref","unstructured":"Richardson, T. and Urbanke, R., Modern Coding Theory, Cambridge, UK: Cambridge Univ. Press, 2008.","DOI":"10.1017\/CBO9780511791338"},{"key":"5107_CR50","doi-asserted-by":"crossref","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"},{"key":"5107_CR51","doi-asserted-by":"crossref","unstructured":"Trofimiuk, G., Shortened Polarization Kernels, in Proc. 2021 IEEE Globecom Workshops (GC Wkshps), Madrid, Spain, Dec.\u00a07\u201311, 2021, pp.\u00a01\u20136. https:\/\/doi.org\/10.1109\/GCWkshps52748.2021.9681982","DOI":"10.1109\/GCWkshps52748.2021.9681982"},{"key":"5107_CR52","unstructured":"Land, I., Reliability Information in Channel Decoding: Practical Aspects and Information Theoretical Bounds, PhD Thesis, Faculty of Engineering, Christian-Albrechts-University of Kiel, Germany, 2005. Availale at https:\/\/macau.uni-kiel.de\/receive\/diss_mods_00001414."},{"key":"5107_CR53","doi-asserted-by":"crossref","unstructured":"Trofimiuk, G. and Trifonov, P., Efficient Decoding of Polar Codes with Some $16\\times 16$ Kernels, in Proc. IEEE 2018 Information Theory Workshop (ITW\u20192018), Guangzhou, China, Nov.\u00a025\u201329, 2018, pp.\u00a011\u201315. https:\/\/doi.org\/10.1109\/ITW.2018.8613307","DOI":"10.1109\/ITW.2018.8613307"},{"key":"5107_CR54","doi-asserted-by":"crossref","unstructured":"Trifonov, P., Design of Polar Codes for Rayleigh Fading Channel, in Proc. 12th Int. Symp. on Wireless Communication Systems (ISWCS 2015), Brussels, Belgium, Aug.\u00a025\u201328, 2015, pp.\u00a0331\u2013335. https:\/\/doi.org\/10.1109\/ISWCS.2015.7454357","DOI":"10.1109\/ISWCS.2015.7454357"}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946024040033.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0032946024040033","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946024040033.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:56:20Z","timestamp":1775012180000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0032946024040033"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12]]},"references-count":54,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["5107"],"URL":"https:\/\/doi.org\/10.1134\/s0032946024040033","relation":{},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12]]},"assertion":[{"value":"9 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 November 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 December 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors of this work declare that they have no conflicts of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}]}}