Loading…

On the Formation of Min-Weight Codewords of Polar/PAC Codes and Its Applications

Minimum weight codewords play a crucial role in the error correction performance of a linear block code. In this work, we establish an explicit construction for these codewords of polar codes as a sum of the generator matrix rows, which can then be used as a foundation for two applications. In the f...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 2023-12, Vol.69 (12), p.7627-7649
Main Authors: Rowshan, Mohammad, Dau, Son Hoang, Viterbo, Emanuele
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c292t-16a72ee2fe2a8233eb0490c8f3c0a75a130a49b06f1356d26058460fa709306e3
cites cdi_FETCH-LOGICAL-c292t-16a72ee2fe2a8233eb0490c8f3c0a75a130a49b06f1356d26058460fa709306e3
container_end_page 7649
container_issue 12
container_start_page 7627
container_title IEEE transactions on information theory
container_volume 69
creator Rowshan, Mohammad
Dau, Son Hoang
Viterbo, Emanuele
description Minimum weight codewords play a crucial role in the error correction performance of a linear block code. In this work, we establish an explicit construction for these codewords of polar codes as a sum of the generator matrix rows, which can then be used as a foundation for two applications. In the first application, we obtain a lower bound for the number of minimum-weight codewords (a.k.a. the error coefficient), which matches the exact number established previously in the literature. In the second application, we derive a novel method that modifies the information set (a.k.a. rate profile) of polar codes and PAC codes in order to reduce the error coefficient, hence improving their performance. More specifically, by analyzing the structure of minimum-weight codewords of polar codes (as special sums of the rows in the polar transform matrix), we can identify rows (corresponding to information bits) that contribute the most to the formation of such codewords and then replace them with other rows (corresponding to frozen bits) that bring in few minimum-weight codewords. A similar process can also be applied to PAC codes. Our approach deviates from the traditional constructions of polar codes, which mostly focus on the reliability of the sub-channels, by taking into account another important factor - the weight distribution. Extensive numerical results show that the modified codes outperform PAC codes and CRC-Polar codes at the practical block error rate of 10^{-2} - 10^{-3} .
doi_str_mv 10.1109/TIT.2023.3319015
format article
fullrecord <record><control><sourceid>proquest_ieee_</sourceid><recordid>TN_cdi_proquest_journals_2895005438</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>10262352</ieee_id><sourcerecordid>2895005438</sourcerecordid><originalsourceid>FETCH-LOGICAL-c292t-16a72ee2fe2a8233eb0490c8f3c0a75a130a49b06f1356d26058460fa709306e3</originalsourceid><addsrcrecordid>eNpNkE1LAzEQhoMoWKt3Dx4CnredfG5yLIvVQqU9VDyGdDexW9rNmmwR_73bj4OnYV6edwYehB4JjAgBPV7NViMKlI0YIxqIuEIDIkSeaSn4NRoAEJVpztUtuktp269cEDpAy0WDu43D0xD3tqtDg4PH73WTfbr6a9PhIlTuJ8QqHfNl2Nk4Xk6KU5ywbSo86xKetO2uLk_1dI9uvN0l93CZQ_QxfVkVb9l88TorJvOspJp2GZE2p85R76hVlDG3Bq6hVJ6VYHNhCQPL9RqkJ0zIikoQikvwNgfNQDo2RM_nu20M3weXOrMNh9j0Lw1VWgAIzlRPwZkqY0gpOm_aWO9t_DUEzNGb6b2Zozdz8dZXns6V2jn3D6eSMkHZH69JZqM</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2895005438</pqid></control><display><type>article</type><title>On the Formation of Min-Weight Codewords of Polar/PAC Codes and Its Applications</title><source>IEEE Xplore (Online service)</source><creator>Rowshan, Mohammad ; Dau, Son Hoang ; Viterbo, Emanuele</creator><creatorcontrib>Rowshan, Mohammad ; Dau, Son Hoang ; Viterbo, Emanuele</creatorcontrib><description><![CDATA[Minimum weight codewords play a crucial role in the error correction performance of a linear block code. In this work, we establish an explicit construction for these codewords of polar codes as a sum of the generator matrix rows, which can then be used as a foundation for two applications. In the first application, we obtain a lower bound for the number of minimum-weight codewords (a.k.a. the error coefficient), which matches the exact number established previously in the literature. In the second application, we derive a novel method that modifies the information set (a.k.a. rate profile) of polar codes and PAC codes in order to reduce the error coefficient, hence improving their performance. More specifically, by analyzing the structure of minimum-weight codewords of polar codes (as special sums of the rows in the polar transform matrix), we can identify rows (corresponding to information bits) that contribute the most to the formation of such codewords and then replace them with other rows (corresponding to frozen bits) that bring in few minimum-weight codewords. A similar process can also be applied to PAC codes. Our approach deviates from the traditional constructions of polar codes, which mostly focus on the reliability of the sub-channels, by taking into account another important factor - the weight distribution. Extensive numerical results show that the modified codes outperform PAC codes and CRC-Polar codes at the practical block error rate of <inline-formula> <tex-math notation="LaTeX">10^{-2} </tex-math></inline-formula>-<inline-formula> <tex-math notation="LaTeX">10^{-3} </tex-math></inline-formula>.]]></description><identifier>ISSN: 0018-9448</identifier><identifier>EISSN: 1557-9654</identifier><identifier>DOI: 10.1109/TIT.2023.3319015</identifier><identifier>CODEN: IETTAW</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>code construction ; Codes ; Error correction ; Error reduction ; list decoding ; Lower bounds ; Maximum likelihood decoding ; minimum hamming distance ; Minimum weight ; PAC codes ; Picture archiving and communication systems ; Polar codes ; Polarization-adjusted convolutional codes ; rate profile ; Reliability ; Signal to noise ratio ; Transforms ; weight distribution</subject><ispartof>IEEE transactions on information theory, 2023-12, Vol.69 (12), p.7627-7649</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2023</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c292t-16a72ee2fe2a8233eb0490c8f3c0a75a130a49b06f1356d26058460fa709306e3</citedby><cites>FETCH-LOGICAL-c292t-16a72ee2fe2a8233eb0490c8f3c0a75a130a49b06f1356d26058460fa709306e3</cites><orcidid>0000-0002-2199-5655 ; 0000-0002-2276-017X ; 0000-0002-5861-2873</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/10262352$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,54796</link.rule.ids></links><search><creatorcontrib>Rowshan, Mohammad</creatorcontrib><creatorcontrib>Dau, Son Hoang</creatorcontrib><creatorcontrib>Viterbo, Emanuele</creatorcontrib><title>On the Formation of Min-Weight Codewords of Polar/PAC Codes and Its Applications</title><title>IEEE transactions on information theory</title><addtitle>TIT</addtitle><description><![CDATA[Minimum weight codewords play a crucial role in the error correction performance of a linear block code. In this work, we establish an explicit construction for these codewords of polar codes as a sum of the generator matrix rows, which can then be used as a foundation for two applications. In the first application, we obtain a lower bound for the number of minimum-weight codewords (a.k.a. the error coefficient), which matches the exact number established previously in the literature. In the second application, we derive a novel method that modifies the information set (a.k.a. rate profile) of polar codes and PAC codes in order to reduce the error coefficient, hence improving their performance. More specifically, by analyzing the structure of minimum-weight codewords of polar codes (as special sums of the rows in the polar transform matrix), we can identify rows (corresponding to information bits) that contribute the most to the formation of such codewords and then replace them with other rows (corresponding to frozen bits) that bring in few minimum-weight codewords. A similar process can also be applied to PAC codes. Our approach deviates from the traditional constructions of polar codes, which mostly focus on the reliability of the sub-channels, by taking into account another important factor - the weight distribution. Extensive numerical results show that the modified codes outperform PAC codes and CRC-Polar codes at the practical block error rate of <inline-formula> <tex-math notation="LaTeX">10^{-2} </tex-math></inline-formula>-<inline-formula> <tex-math notation="LaTeX">10^{-3} </tex-math></inline-formula>.]]></description><subject>code construction</subject><subject>Codes</subject><subject>Error correction</subject><subject>Error reduction</subject><subject>list decoding</subject><subject>Lower bounds</subject><subject>Maximum likelihood decoding</subject><subject>minimum hamming distance</subject><subject>Minimum weight</subject><subject>PAC codes</subject><subject>Picture archiving and communication systems</subject><subject>Polar codes</subject><subject>Polarization-adjusted convolutional codes</subject><subject>rate profile</subject><subject>Reliability</subject><subject>Signal to noise ratio</subject><subject>Transforms</subject><subject>weight distribution</subject><issn>0018-9448</issn><issn>1557-9654</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><recordid>eNpNkE1LAzEQhoMoWKt3Dx4CnredfG5yLIvVQqU9VDyGdDexW9rNmmwR_73bj4OnYV6edwYehB4JjAgBPV7NViMKlI0YIxqIuEIDIkSeaSn4NRoAEJVpztUtuktp269cEDpAy0WDu43D0xD3tqtDg4PH73WTfbr6a9PhIlTuJ8QqHfNl2Nk4Xk6KU5ywbSo86xKetO2uLk_1dI9uvN0l93CZQ_QxfVkVb9l88TorJvOspJp2GZE2p85R76hVlDG3Bq6hVJ6VYHNhCQPL9RqkJ0zIikoQikvwNgfNQDo2RM_nu20M3weXOrMNh9j0Lw1VWgAIzlRPwZkqY0gpOm_aWO9t_DUEzNGb6b2Zozdz8dZXns6V2jn3D6eSMkHZH69JZqM</recordid><startdate>20231201</startdate><enddate>20231201</enddate><creator>Rowshan, Mohammad</creator><creator>Dau, Son Hoang</creator><creator>Viterbo, Emanuele</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0002-2199-5655</orcidid><orcidid>https://orcid.org/0000-0002-2276-017X</orcidid><orcidid>https://orcid.org/0000-0002-5861-2873</orcidid></search><sort><creationdate>20231201</creationdate><title>On the Formation of Min-Weight Codewords of Polar/PAC Codes and Its Applications</title><author>Rowshan, Mohammad ; Dau, Son Hoang ; Viterbo, Emanuele</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c292t-16a72ee2fe2a8233eb0490c8f3c0a75a130a49b06f1356d26058460fa709306e3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>code construction</topic><topic>Codes</topic><topic>Error correction</topic><topic>Error reduction</topic><topic>list decoding</topic><topic>Lower bounds</topic><topic>Maximum likelihood decoding</topic><topic>minimum hamming distance</topic><topic>Minimum weight</topic><topic>PAC codes</topic><topic>Picture archiving and communication systems</topic><topic>Polar codes</topic><topic>Polarization-adjusted convolutional codes</topic><topic>rate profile</topic><topic>Reliability</topic><topic>Signal to noise ratio</topic><topic>Transforms</topic><topic>weight distribution</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Rowshan, Mohammad</creatorcontrib><creatorcontrib>Dau, Son Hoang</creatorcontrib><creatorcontrib>Viterbo, Emanuele</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE/IET Electronic Library</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on information theory</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Rowshan, Mohammad</au><au>Dau, Son Hoang</au><au>Viterbo, Emanuele</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On the Formation of Min-Weight Codewords of Polar/PAC Codes and Its Applications</atitle><jtitle>IEEE transactions on information theory</jtitle><stitle>TIT</stitle><date>2023-12-01</date><risdate>2023</risdate><volume>69</volume><issue>12</issue><spage>7627</spage><epage>7649</epage><pages>7627-7649</pages><issn>0018-9448</issn><eissn>1557-9654</eissn><coden>IETTAW</coden><abstract><![CDATA[Minimum weight codewords play a crucial role in the error correction performance of a linear block code. In this work, we establish an explicit construction for these codewords of polar codes as a sum of the generator matrix rows, which can then be used as a foundation for two applications. In the first application, we obtain a lower bound for the number of minimum-weight codewords (a.k.a. the error coefficient), which matches the exact number established previously in the literature. In the second application, we derive a novel method that modifies the information set (a.k.a. rate profile) of polar codes and PAC codes in order to reduce the error coefficient, hence improving their performance. More specifically, by analyzing the structure of minimum-weight codewords of polar codes (as special sums of the rows in the polar transform matrix), we can identify rows (corresponding to information bits) that contribute the most to the formation of such codewords and then replace them with other rows (corresponding to frozen bits) that bring in few minimum-weight codewords. A similar process can also be applied to PAC codes. Our approach deviates from the traditional constructions of polar codes, which mostly focus on the reliability of the sub-channels, by taking into account another important factor - the weight distribution. Extensive numerical results show that the modified codes outperform PAC codes and CRC-Polar codes at the practical block error rate of <inline-formula> <tex-math notation="LaTeX">10^{-2} </tex-math></inline-formula>-<inline-formula> <tex-math notation="LaTeX">10^{-3} </tex-math></inline-formula>.]]></abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TIT.2023.3319015</doi><tpages>23</tpages><orcidid>https://orcid.org/0000-0002-2199-5655</orcidid><orcidid>https://orcid.org/0000-0002-2276-017X</orcidid><orcidid>https://orcid.org/0000-0002-5861-2873</orcidid></addata></record>
fulltext fulltext
identifier ISSN: 0018-9448
ispartof IEEE transactions on information theory, 2023-12, Vol.69 (12), p.7627-7649
issn 0018-9448
1557-9654
language eng
recordid cdi_proquest_journals_2895005438
source IEEE Xplore (Online service)
subjects code construction
Codes
Error correction
Error reduction
list decoding
Lower bounds
Maximum likelihood decoding
minimum hamming distance
Minimum weight
PAC codes
Picture archiving and communication systems
Polar codes
Polarization-adjusted convolutional codes
rate profile
Reliability
Signal to noise ratio
Transforms
weight distribution
title On the Formation of Min-Weight Codewords of Polar/PAC Codes and Its Applications
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T07%3A15%3A16IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_ieee_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20the%20Formation%20of%20Min-Weight%20Codewords%20of%20Polar/PAC%20Codes%20and%20Its%20Applications&rft.jtitle=IEEE%20transactions%20on%20information%20theory&rft.au=Rowshan,%20Mohammad&rft.date=2023-12-01&rft.volume=69&rft.issue=12&rft.spage=7627&rft.epage=7649&rft.pages=7627-7649&rft.issn=0018-9448&rft.eissn=1557-9654&rft.coden=IETTAW&rft_id=info:doi/10.1109/TIT.2023.3319015&rft_dat=%3Cproquest_ieee_%3E2895005438%3C/proquest_ieee_%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c292t-16a72ee2fe2a8233eb0490c8f3c0a75a130a49b06f1356d26058460fa709306e3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2895005438&rft_id=info:pmid/&rft_ieee_id=10262352&rfr_iscdi=true