{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T06:46:52Z","timestamp":1769064412552,"version":"3.49.0"},"reference-count":26,"publisher":"Institution of Engineering and Technology (IET)","issue":"1","license":[{"start":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T00:00:00Z","timestamp":1768953600000},"content-version":"vor","delay-in-days":20,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2024YFB2908604"],"award-info":[{"award-number":["2024YFB2908604"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["ietresearch.onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["IET Communications"],"published-print":{"date-parts":[[2026,1]]},"abstract":"<jats:title>ABSTRACT<\/jats:title>\n                  <jats:p>This paper explores the practical application of source polar codes to entropy coding tasks in modern transform coding pipelines. Transform coding remains the predominant and rapidly evolving framework for compressing complex real\u2010world data. Despite the strong theoretical guarantees of polar codes, conventional polarization\u2010based compression techniques follow a \u201cconstruct\u2010then\u2010use\u201d paradigm, which proves inefficient and inaccurate when applied to transform coding scenarios characterized by highly dynamic entropy models. To overcome this limitation, we propose a construction\u2010free, plug\u2010and\u2010play polar compression scheme. Rather than relying on precomputed polarized entropies, our method selects output symbols based on probability vectors generated by a conditional entropy model. These vectors can be computed with low complexity and exact numerical precision, enabling efficient adaptation across diverse entropy coding tasks. The proposed approach offers greater flexibility than classical methods and achieves superior performance in the finite\u2010length\u00a0regime.<\/jats:p>","DOI":"10.1049\/cmu2.70130","type":"journal-article","created":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T15:05:01Z","timestamp":1769007901000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Construction\u2010Free Polar Coding For Practical Entropy Coding Tasks"],"prefix":"10.1049","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-5041-5708","authenticated-orcid":false,"given":"Zichang","family":"Ren","sequence":"first","affiliation":[{"name":"School of Electronics Peking University Beijing China"}]},{"given":"Cheng","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Electronics Peking University Beijing China"}]},{"given":"Yuping","family":"Zhao","sequence":"additional","affiliation":[{"name":"School of Electronics Peking University Beijing China"}]}],"member":"265","published-online":{"date-parts":[[2026,1,21]]},"reference":[{"key":"e_1_2_10_2_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"e_1_2_10_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"},{"key":"e_1_2_10_4_1","first-page":"1488","volume-title":"IEEE International Symposium on Information Theory","author":"Hussami N.","year":"2009"},{"key":"e_1_2_10_5_1","first-page":"899","volume-title":"IEEE International Symposium on Information Theory","author":"Arikan E.","year":"2010"},{"key":"e_1_2_10_6_1","doi-asserted-by":"crossref","unstructured":"S. B.KoradaandR. L.Urbanke \u201cPolar Codes are Optimal for Lossy Source Coding \u201dIEEE Transactions on Information Theory56 no.4(IEEE 2010):1751\u20131768.","DOI":"10.1109\/TIT.2010.2040961"},{"key":"e_1_2_10_7_1","first-page":"566","volume-title":"IEEE International Symposium on Information Theory","author":"Bilkent E. A.","year":"2012"},{"key":"e_1_2_10_8_1","first-page":"1","volume-title":"2010 IEEE Information Theory Workshop on Information Theory","author":"Korada S. B.","year":"2010"},{"key":"e_1_2_10_9_1","first-page":"904","volume-title":"IEEE International Symposium on Information Theory","author":"Cronie H. S.","year":"2010"},{"key":"e_1_2_10_10_1","first-page":"1132","volume-title":"IEEE International Symposium on Information Theory","author":"\u00c7ayci S.","year":"2013"},{"key":"e_1_2_10_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2021.3088941"},{"key":"e_1_2_10_12_1","doi-asserted-by":"crossref","first-page":"1560","DOI":"10.1109\/LSP.2024.3407478","article-title":"Probabilistic Shaped Joint Source\u2010Channel Polar\u2010Coded Modulation","volume":"31","author":"Liao G.\u2010J.","year":"2024","journal-title":"IEEE Signal Processing Letters"},{"key":"e_1_2_10_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/79.952802"},{"key":"e_1_2_10_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/214762.214771"},{"issue":"2","key":"e_1_2_10_15_1","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1109\/JSTSP.2020.3034501","article-title":"Nonlinear Transform Coding","volume":"15","author":"Ball\u00e9 J.","year":"2021","journal-title":"IEEE Journal of Selected Topics in Signal Processing"},{"key":"e_1_2_10_16_1","first-page":"7936","volume-title":"IEEE\/CVF Conference on Computer Vision and Pattern Recognition (CVPR)","author":"Cheng Z.","year":"2020"},{"key":"e_1_2_10_17_1","unstructured":"J.Ball\u00e9 D.Minnen S.Singh S. J.Hwang andN.Johnston \u201cVariational Image Compression With a Scale Hyperprior \u201darXiv:1802.01436(2018)."},{"key":"e_1_2_10_18_1","first-page":"1496","volume-title":"IEEE International Symposium on Information Theory","author":"Mori R.","year":"2009"},{"issue":"10","key":"e_1_2_10_19_1","doi-asserted-by":"crossref","first-page":"6562","DOI":"10.1109\/TIT.2013.2272694","article-title":"How to Construct Polar Codes","volume":"59","author":"Tal I.","year":"2013","journal-title":"IEEE Transactions on Information Theory"},{"key":"e_1_2_10_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2908870"},{"key":"e_1_2_10_21_1","doi-asserted-by":"crossref","unstructured":"D.He Y.Zheng B.Sun Y.Wang andH.Qin \u201cCheckerboard Context Model for Efficient Learned Image Compression \u201d inIEEE\/CVF Conference on Computer Vision and Pattern Recognition (CVPR)(IEEE 2021) 14766\u201314775.","DOI":"10.1109\/CVPR46437.2021.01453"},{"key":"e_1_2_10_22_1","doi-asserted-by":"crossref","unstructured":"E.\u015ea\u015fo\u011flu E.Telatar andE.Arikan \u201cPolarization for Arbitrary Discrete Memoryless Channels \u201d in2010 IEEE Information Theory Workshop on Information Theory(IEEE 2009) 144\u2013148.","DOI":"10.1109\/ITW.2009.5351487"},{"issue":"5","key":"e_1_2_10_23_1","doi-asserted-by":"crossref","first-page":"2720","DOI":"10.1109\/TIT.2014.2312181","article-title":"Source and Channel Polarization Over Finite Fields and Reed\u2013Solomon Matrices","volume":"60","author":"Mori R.","year":"2014","journal-title":"IEEE Transactions on Information Theory"},{"issue":"11","key":"e_1_2_10_24_1","doi-asserted-by":"crossref","first-page":"6920","DOI":"10.1109\/TIT.2020.3020929","article-title":"Polar Coding for Non\u2010Stationary Channels","volume":"66","author":"Mahdavifar H.","year":"2020","journal-title":"IEEE Transactions on Information Theory"},{"key":"e_1_2_10_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2410251"},{"key":"e_1_2_10_26_1","doi-asserted-by":"crossref","unstructured":"F.Mentzer E.Agustsson M.Tschannen R.Timofte andL.Van Gool \u201cPractical Full Resolution Learned Lossless Image Compression \u201d inIEEE\/CVF Conference on Computer Vision and Pattern Recognition (CVPR)(IEEE 2019) 10621\u201310630.","DOI":"10.1109\/CVPR.2019.01088"},{"key":"e_1_2_10_27_1","unstructured":"A.Said \u201cIntroduction to Arithmetic Coding \u2013 Theory and Practice \u201darXiv:2302.00819(2023)."}],"container-title":["IET Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/ietresearch.onlinelibrary.wiley.com\/doi\/pdf\/10.1049\/cmu2.70130","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/ietresearch.onlinelibrary.wiley.com\/doi\/full-xml\/10.1049\/cmu2.70130","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/ietresearch.onlinelibrary.wiley.com\/doi\/pdf\/10.1049\/cmu2.70130","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T15:05:06Z","timestamp":1769007906000},"score":1,"resource":{"primary":{"URL":"https:\/\/ietresearch.onlinelibrary.wiley.com\/doi\/10.1049\/cmu2.70130"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["10.1049\/cmu2.70130"],"URL":"https:\/\/doi.org\/10.1049\/cmu2.70130","archive":["Portico"],"relation":{},"ISSN":["1751-8628","1751-8636"],"issn-type":[{"value":"1751-8628","type":"print"},{"value":"1751-8636","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1]]},"assertion":[{"value":"2025-05-29","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-01-03","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-01-21","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"e70130"}}