A cyclic redundancy check aided encoding construction method for list sphere polar decoder
Polar codes are the only error-correcting codes that have been mathematically proven to achieve the Shannon limit to date, playing a crucial role in the control channels of 5G mobile communication systems. For control channels, although the sphere decoding (SD) algorithm boasts excellent performance...
Saved in:
| Published in: | Scientific reports Vol. 15; no. 1; pp. 30848 - 15 |
|---|---|
| Main Authors: | , , , , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
London
Nature Publishing Group UK
22.08.2025
Nature Publishing Group Nature Portfolio |
| Subjects: | |
| ISSN: | 2045-2322, 2045-2322 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | Polar codes are the only error-correcting codes that have been mathematically proven to achieve the Shannon limit to date, playing a crucial role in the control channels of 5G mobile communication systems. For control channels, although the sphere decoding (SD) algorithm boasts excellent performance, its high computational complexity and significant latency present clear limitations in practical applications. In contrast, the list sphere decoding (LSD) algorithm strikes a balance between performance and complexity. This paper proposes a construction method that delays the decoding of specific information bits with the minimum row weight to mitigate the impact of error propagation. For scenarios where the total number of delay-decodable bits is limited, we introduce a segmented construction strategy. Through mathematical analysis, this strategy effectively increases the number of delay-decodable bits, thereby significantly reducing the impact of error propagation without changing the number of transmitted bits. Simulation results show that the decoding performance of the proposed algorithm is comparable to that of the SD algorithm at medium and low code rates (with a difference of less than 0.2 dB), but it abandons the concept of search radius in the SD algorithm and does not require a backtracking process. Furthermore, under high code rate conditions, such as
P
(32, 20), the proposed algorithm also maintains excellent performance. |
|---|---|
| AbstractList | Abstract Polar codes are the only error-correcting codes that have been mathematically proven to achieve the Shannon limit to date, playing a crucial role in the control channels of 5G mobile communication systems. For control channels, although the sphere decoding (SD) algorithm boasts excellent performance, its high computational complexity and significant latency present clear limitations in practical applications. In contrast, the list sphere decoding (LSD) algorithm strikes a balance between performance and complexity. This paper proposes a construction method that delays the decoding of specific information bits with the minimum row weight to mitigate the impact of error propagation. For scenarios where the total number of delay-decodable bits is limited, we introduce a segmented construction strategy. Through mathematical analysis, this strategy effectively increases the number of delay-decodable bits, thereby significantly reducing the impact of error propagation without changing the number of transmitted bits. Simulation results show that the decoding performance of the proposed algorithm is comparable to that of the SD algorithm at medium and low code rates (with a difference of less than 0.2 dB), but it abandons the concept of search radius in the SD algorithm and does not require a backtracking process. Furthermore, under high code rate conditions, such as P(32, 20), the proposed algorithm also maintains excellent performance. Polar codes are the only error-correcting codes that have been mathematically proven to achieve the Shannon limit to date, playing a crucial role in the control channels of 5G mobile communication systems. For control channels, although the sphere decoding (SD) algorithm boasts excellent performance, its high computational complexity and significant latency present clear limitations in practical applications. In contrast, the list sphere decoding (LSD) algorithm strikes a balance between performance and complexity. This paper proposes a construction method that delays the decoding of specific information bits with the minimum row weight to mitigate the impact of error propagation. For scenarios where the total number of delay-decodable bits is limited, we introduce a segmented construction strategy. Through mathematical analysis, this strategy effectively increases the number of delay-decodable bits, thereby significantly reducing the impact of error propagation without changing the number of transmitted bits. Simulation results show that the decoding performance of the proposed algorithm is comparable to that of the SD algorithm at medium and low code rates (with a difference of less than 0.2 dB), but it abandons the concept of search radius in the SD algorithm and does not require a backtracking process. Furthermore, under high code rate conditions, such as P(32, 20), the proposed algorithm also maintains excellent performance. Polar codes are the only error-correcting codes that have been mathematically proven to achieve the Shannon limit to date, playing a crucial role in the control channels of 5G mobile communication systems. For control channels, although the sphere decoding (SD) algorithm boasts excellent performance, its high computational complexity and significant latency present clear limitations in practical applications. In contrast, the list sphere decoding (LSD) algorithm strikes a balance between performance and complexity. This paper proposes a construction method that delays the decoding of specific information bits with the minimum row weight to mitigate the impact of error propagation. For scenarios where the total number of delay-decodable bits is limited, we introduce a segmented construction strategy. Through mathematical analysis, this strategy effectively increases the number of delay-decodable bits, thereby significantly reducing the impact of error propagation without changing the number of transmitted bits. Simulation results show that the decoding performance of the proposed algorithm is comparable to that of the SD algorithm at medium and low code rates (with a difference of less than 0.2 dB), but it abandons the concept of search radius in the SD algorithm and does not require a backtracking process. Furthermore, under high code rate conditions, such as P(32, 20), the proposed algorithm also maintains excellent performance. Polar codes are the only error-correcting codes that have been mathematically proven to achieve the Shannon limit to date, playing a crucial role in the control channels of 5G mobile communication systems. For control channels, although the sphere decoding (SD) algorithm boasts excellent performance, its high computational complexity and significant latency present clear limitations in practical applications. In contrast, the list sphere decoding (LSD) algorithm strikes a balance between performance and complexity. This paper proposes a construction method that delays the decoding of specific information bits with the minimum row weight to mitigate the impact of error propagation. For scenarios where the total number of delay-decodable bits is limited, we introduce a segmented construction strategy. Through mathematical analysis, this strategy effectively increases the number of delay-decodable bits, thereby significantly reducing the impact of error propagation without changing the number of transmitted bits. Simulation results show that the decoding performance of the proposed algorithm is comparable to that of the SD algorithm at medium and low code rates (with a difference of less than 0.2 dB), but it abandons the concept of search radius in the SD algorithm and does not require a backtracking process. Furthermore, under high code rate conditions, such as P(32, 20), the proposed algorithm also maintains excellent performance.Polar codes are the only error-correcting codes that have been mathematically proven to achieve the Shannon limit to date, playing a crucial role in the control channels of 5G mobile communication systems. For control channels, although the sphere decoding (SD) algorithm boasts excellent performance, its high computational complexity and significant latency present clear limitations in practical applications. In contrast, the list sphere decoding (LSD) algorithm strikes a balance between performance and complexity. This paper proposes a construction method that delays the decoding of specific information bits with the minimum row weight to mitigate the impact of error propagation. For scenarios where the total number of delay-decodable bits is limited, we introduce a segmented construction strategy. Through mathematical analysis, this strategy effectively increases the number of delay-decodable bits, thereby significantly reducing the impact of error propagation without changing the number of transmitted bits. Simulation results show that the decoding performance of the proposed algorithm is comparable to that of the SD algorithm at medium and low code rates (with a difference of less than 0.2 dB), but it abandons the concept of search radius in the SD algorithm and does not require a backtracking process. Furthermore, under high code rate conditions, such as P(32, 20), the proposed algorithm also maintains excellent performance. Polar codes are the only error-correcting codes that have been mathematically proven to achieve the Shannon limit to date, playing a crucial role in the control channels of 5G mobile communication systems. For control channels, although the sphere decoding (SD) algorithm boasts excellent performance, its high computational complexity and significant latency present clear limitations in practical applications. In contrast, the list sphere decoding (LSD) algorithm strikes a balance between performance and complexity. This paper proposes a construction method that delays the decoding of specific information bits with the minimum row weight to mitigate the impact of error propagation. For scenarios where the total number of delay-decodable bits is limited, we introduce a segmented construction strategy. Through mathematical analysis, this strategy effectively increases the number of delay-decodable bits, thereby significantly reducing the impact of error propagation without changing the number of transmitted bits. Simulation results show that the decoding performance of the proposed algorithm is comparable to that of the SD algorithm at medium and low code rates (with a difference of less than 0.2 dB), but it abandons the concept of search radius in the SD algorithm and does not require a backtracking process. Furthermore, under high code rate conditions, such as P (32, 20), the proposed algorithm also maintains excellent performance. |
| ArticleNumber | 30848 |
| Author | Dang, Shuping Chen, Haiqiang Hu, Wenbin Guo, Qinhua Sun, Youming Li, Xiangcheng Wang, Rui |
| Author_xml | – sequence: 1 givenname: Wenbin surname: Hu fullname: Hu, Wenbin organization: School of Computer, Electronics and Information, Guangxi University – sequence: 2 givenname: Haiqiang surname: Chen fullname: Chen, Haiqiang email: haiqiang@gxu.edu.cn organization: School of Computer, Electronics and Information, Guangxi University, Nanning University, Guangxi Key Laboratory of Multimedia Communications and Network Technology – sequence: 3 givenname: Rui surname: Wang fullname: Wang, Rui organization: School of Computer, Electronics and Information, Guangxi University – sequence: 4 givenname: Qinhua surname: Guo fullname: Guo, Qinhua organization: School of Computer, Electronics and Information, Guangxi University – sequence: 5 givenname: Shuping surname: Dang fullname: Dang, Shuping organization: School of Electrical, Electronic and Mechanical Engineering, University of Bristol – sequence: 6 givenname: Youming surname: Sun fullname: Sun, Youming organization: School of Computer, Electronics and Information, Guangxi University, Guangxi Key Laboratory of Multimedia Communications and Network Technology – sequence: 7 givenname: Xiangcheng surname: Li fullname: Li, Xiangcheng organization: School of Computer, Electronics and Information, Guangxi University, Guangxi Key Laboratory of Multimedia Communications and Network Technology |
| BackLink | https://www.ncbi.nlm.nih.gov/pubmed/40847105$$D View this record in MEDLINE/PubMed |
| BookMark | eNp9UstuFDEQtFAQCUt-gAOyxIXLgB_teZxQFJEQKRIXuHCxPHbPrpdZe7FnkPbv8WZCSDhgyXarXVXdatdLchJiQEJec_aeM9l-yMBV11ZMqKoEsq7kM3ImGKhKSCFOHsWn5DznLStLiQ5494KcAmuh4Uydke8X1B7s6C1N6ObgTLAHajdof1DjHTqKwUbnw5raGPKUZjv5GOgOp010dIiJjj5PNO83mJDu42gSdVgomF6R54MZM57f3yvy7erT18vP1e2X65vLi9vKQgdTBbxpRdMbgx0yBuV0lom6ViUz2IZ3Qyv7FizAwMXQWAOGg7Q49LZv6raWK3Kz6Lpotnqf_M6kg47G67tETGtt0uTtiNqYMg_rJBPOAKjOgFJcqJ51rJR1vGh9XLT2c78rjWCYkhmfiD59CX6j1_GX5kI2suVHhXf3Cin-nDFPeuezxXE0AeOctRRQl90yKNC3_0C3cU6hzOqIEsBkU2RX5M3jlh56-fOHBSAWgE0x54TDA4QzffSKXryii1f0nVe0LCS5kHIBhzWmv7X_w_oNLYLBIA |
| Cites_doi | 10.1109/TIT.2015.2410251 10.1109/TIT.2009.2021379 10.1109/LCOMM.2014.010214.131826 10.1109/TVT.2019.2912709 10.1109/ISIT.2012.6283643 10.1109/LCOMM.2008.080017 10.1109/LCOMM.2012.090312.121501 10.1109/ISIT.2009.5205857 10.1109/TCOMM.2012.081512.110872 10.1109/VTCSpring.2016.7504469 10.1109/TVT.2019.2959093 10.1109/ISIT.2009.5205856 10.1109/TVT.2017.2761262 10.23919/ICN.2021.0024 10.1109/ISIT.2016.7541293 10.1109/LCOMM.2009.090428 10.1109/ISCAS.2016.7538902 10.1007/s11265-019-01506-0 10.1109/ACSSC.2015.7421362 |
| ContentType | Journal Article |
| Copyright | The Author(s) 2025 2025. The Author(s). The Author(s) 2025. This work is published under http://creativecommons.org/licenses/by-nc-nd/4.0/ (the "License"). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. The Author(s) 2025 2025 |
| Copyright_xml | – notice: The Author(s) 2025 – notice: 2025. The Author(s). – notice: The Author(s) 2025. This work is published under http://creativecommons.org/licenses/by-nc-nd/4.0/ (the "License"). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. – notice: The Author(s) 2025 2025 |
| DBID | C6C AAYXX CITATION NPM 3V. 7X7 7XB 88A 88E 88I 8FE 8FH 8FI 8FJ 8FK ABUWG AEUYN AFKRA AZQEC BBNVY BENPR BHPHI CCPQU DWQXO FYUFA GHDGH GNUQQ HCIFZ K9. LK8 M0S M1P M2P M7P PHGZM PHGZT PIMPY PJZUB PKEHL PPXIY PQEST PQGLB PQQKQ PQUKI Q9U 7X8 5PM DOA |
| DOI | 10.1038/s41598-025-15936-3 |
| DatabaseName | Springer Nature OA Free Journals CrossRef PubMed ProQuest Central (Corporate) Health & Medical Collection ProQuest Central (purchase pre-March 2016) Biology Database (Alumni Edition) Medical Database (Alumni Edition) Science Database (Alumni Edition) ProQuest SciTech Collection ProQuest Natural Science Collection ProQuest Hospital Collection Hospital Premium Collection (Alumni Edition) ProQuest Central (Alumni) (purchase pre-March 2016) ProQuest Central (Alumni) One Sustainability ProQuest Central UK/Ireland ProQuest Central Essentials Biological Science Collection ProQuest Central Natural Science Collection ProQuest One ProQuest Central Proquest Health Research Premium Collection Health Research Premium Collection (Alumni) ProQuest Central Student SciTech Premium Collection ProQuest Health & Medical Complete (Alumni) Biological Sciences ProQuest Health & Medical Collection PML(ProQuest Medical Library) Science Database Biological Science Database ProQuest Databases ProQuest One Academic Publicly Available Content Database ProQuest Health & Medical Research Collection ProQuest One Academic Middle East (New) One Health & Nursing ProQuest One Academic Eastern Edition (DO NOT USE) One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central Basic MEDLINE - Academic PubMed Central (Full Participant titles) DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef PubMed Publicly Available Content Database ProQuest Central Student ProQuest One Academic Middle East (New) ProQuest Central Essentials ProQuest Health & Medical Complete (Alumni) ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest One Health & Nursing ProQuest Natural Science Collection ProQuest Biology Journals (Alumni Edition) ProQuest Central ProQuest One Applied & Life Sciences ProQuest One Sustainability ProQuest Health & Medical Research Collection Health Research Premium Collection Health and Medicine Complete (Alumni Edition) Natural Science Collection ProQuest Central Korea Health & Medical Research Collection Biological Science Collection ProQuest Central (New) ProQuest Medical Library (Alumni) ProQuest Science Journals (Alumni Edition) ProQuest Biological Science Collection ProQuest Central Basic ProQuest Science Journals ProQuest One Academic Eastern Edition ProQuest Hospital Collection Health Research Premium Collection (Alumni) Biological Science Database ProQuest SciTech Collection ProQuest Hospital Collection (Alumni) ProQuest Health & Medical Complete ProQuest Medical Library ProQuest One Academic UKI Edition ProQuest One Academic ProQuest One Academic (New) ProQuest Central (Alumni) MEDLINE - Academic |
| DatabaseTitleList | Publicly Available Content Database MEDLINE - Academic PubMed |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: NPM name: PubMed url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed sourceTypes: Index Database – sequence: 3 dbid: PIMPY name: ProQuest Publicly Available Content Database url: http://search.proquest.com/publiccontent sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Biology |
| EISSN | 2045-2322 |
| EndPage | 15 |
| ExternalDocumentID | oai_doaj_org_article_aa322cd302da4459a455125b0909edd1 PMC12373811 40847105 10_1038_s41598_025_15936_3 |
| Genre | Journal Article |
| GrantInformation_xml | – fundername: KR&DP of Guangxi grantid: GuiKeAB23075200; GuiKeAB23075200; GuiKeAB23075200; GuiKeAB23075200; GuiKeAB23075200; GuiKeAB23075200; GuiKeAB23075200 – fundername: National Natural Science Foundation of China grantid: 62261003; 62261003; 62261003; 62261003; 62261003; 62261003; 62261003 funderid: https://doi.org/10.13039/501100001809 – fundername: KR&DP of Guangxi grantid: GuiKeAB23075200 – fundername: National Natural Science Foundation of China grantid: 62261003 |
| GroupedDBID | 0R~ 4.4 53G 5VS 7X7 88E 88I 8FE 8FH 8FI 8FJ AAFWJ AAJSJ AAKDD AASML ABDBF ABUWG ACGFS ACUHS ADBBV ADRAZ AENEX AEUYN AFKRA AFPKN ALMA_UNASSIGNED_HOLDINGS AOIJS AZQEC BAWUL BBNVY BCNDV BENPR BHPHI BPHCQ BVXVI C6C CCPQU DIK DWQXO EBD EBLON EBS ESX FYUFA GNUQQ GROUPED_DOAJ GX1 HCIFZ HH5 HMCUK HYE KQ8 LK8 M1P M2P M7P M~E NAO OK1 PHGZM PHGZT PIMPY PJZUB PPXIY PQGLB PQQKQ PROAC PSQYO RNT RNTTT RPM SNYQT UKHRP AAYXX AFFHD CITATION NPM PUEGO 3V. 7XB 88A 8FK K9. M48 PKEHL PQEST PQUKI Q9U 7X8 5PM |
| ID | FETCH-LOGICAL-c494t-417827baae9e004e9edc02665aaefc719f83b84c44f12f7ca4a143cefbcb76863 |
| IEDL.DBID | BENPR |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001587718700008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 2045-2322 |
| IngestDate | Fri Oct 03 12:36:24 EDT 2025 Tue Nov 04 02:05:53 EST 2025 Thu Sep 04 12:32:20 EDT 2025 Tue Oct 07 07:36:36 EDT 2025 Thu Sep 04 05:02:58 EDT 2025 Sat Nov 29 07:32:02 EST 2025 Sat Aug 23 01:10:07 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | LSD algorithm Delayed decoding Polar codes Channel coding SD algorithm |
| Language | English |
| License | 2025. The Author(s). Open Access This article is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License, which permits any non-commercial use, sharing, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if you modified the licensed material. You do not have permission under this licence to share adapted material derived from this article or parts of it. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by-nc-nd/4.0/. |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c494t-417827baae9e004e9edc02665aaefc719f83b84c44f12f7ca4a143cefbcb76863 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 |
| OpenAccessLink | https://www.proquest.com/docview/3242403712?pq-origsite=%requestingapplication% |
| PMID | 40847105 |
| PQID | 3242403712 |
| PQPubID | 2041939 |
| PageCount | 15 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_aa322cd302da4459a455125b0909edd1 pubmedcentral_primary_oai_pubmedcentral_nih_gov_12373811 proquest_miscellaneous_3246324804 proquest_journals_3242403712 pubmed_primary_40847105 crossref_primary_10_1038_s41598_025_15936_3 springer_journals_10_1038_s41598_025_15936_3 |
| PublicationCentury | 2000 |
| PublicationDate | 2025-08-22 |
| PublicationDateYYYYMMDD | 2025-08-22 |
| PublicationDate_xml | – month: 08 year: 2025 text: 2025-08-22 day: 22 |
| PublicationDecade | 2020 |
| PublicationPlace | London |
| PublicationPlace_xml | – name: London – name: England |
| PublicationTitle | Scientific reports |
| PublicationTitleAbbrev | Sci Rep |
| PublicationTitleAlternate | Sci Rep |
| PublicationYear | 2025 |
| Publisher | Nature Publishing Group UK Nature Publishing Group Nature Portfolio |
| Publisher_xml | – name: Nature Publishing Group UK – name: Nature Publishing Group – name: Nature Portfolio |
| References | H Zhou (15936_CR9) 2019; 69 15936_CR15 I Tal (15936_CR3) 2015; 61 15936_CR13 SA Hashemi (15936_CR12) 2016; 63 15936_CR6 15936_CR18 Q Zeng (15936_CR5) 2021; 2 H Zhou (15936_CR14) 2019; 68 E Arikan (15936_CR19) 2008; 12 C Husmann (15936_CR8) 2017; 67 15936_CR11 K Niu (15936_CR7) 2014; 18 15936_CR21 Y Liu (15936_CR10) 2023; 13 E Arikan (15936_CR2) 2009; 55 H Zhou (15936_CR20) 2020; 92 K Niu (15936_CR4) 2012; 16 P Trifonov (15936_CR17) 2012; 60 15936_CR1 R Mori (15936_CR16) 2009; 13 |
| References_xml | – volume: 61 start-page: 2213 year: 2015 ident: 15936_CR3 publication-title: IEEE Transactions on Inf. Theory doi: 10.1109/TIT.2015.2410251 – volume: 63 start-page: 2368 year: 2016 ident: 15936_CR12 publication-title: IEEE Transactions on Circuits Syst. I: Regul. Pap. – volume: 55 start-page: 3051 year: 2009 ident: 15936_CR2 publication-title: IEEE Transactions on Inf. Theory doi: 10.1109/TIT.2009.2021379 – volume: 18 start-page: 332 year: 2014 ident: 15936_CR7 publication-title: IEEE Commun. Lett. doi: 10.1109/LCOMM.2014.010214.131826 – volume: 68 start-page: 5236 year: 2019 ident: 15936_CR14 publication-title: IEEE Transactions on Veh. Technol. doi: 10.1109/TVT.2019.2912709 – ident: 15936_CR6 doi: 10.1109/ISIT.2012.6283643 – volume: 12 start-page: 447 year: 2008 ident: 15936_CR19 publication-title: IEEE Commun. Lett. doi: 10.1109/LCOMM.2008.080017 – volume: 16 start-page: 1668 year: 2012 ident: 15936_CR4 publication-title: IEEE Commun. Lett. doi: 10.1109/LCOMM.2012.090312.121501 – volume: 13 start-page: 1191 year: 2023 ident: 15936_CR10 publication-title: Sci. Reports – ident: 15936_CR15 doi: 10.1109/ISIT.2009.5205857 – volume: 60 start-page: 3221 year: 2012 ident: 15936_CR17 publication-title: IEEE Transactions on Commun. doi: 10.1109/TCOMM.2012.081512.110872 – ident: 15936_CR21 doi: 10.1109/VTCSpring.2016.7504469 – volume: 69 start-page: 1257 year: 2019 ident: 15936_CR9 publication-title: IEEE Transactions on Veh. Technol. doi: 10.1109/TVT.2019.2959093 – ident: 15936_CR1 doi: 10.1109/ISIT.2009.5205856 – volume: 67 start-page: 1835 year: 2017 ident: 15936_CR8 publication-title: IEEE Transactions on Veh. Technol. doi: 10.1109/TVT.2017.2761262 – volume: 2 start-page: 334 year: 2021 ident: 15936_CR5 publication-title: Intell. Converged Networks doi: 10.23919/ICN.2021.0024 – ident: 15936_CR18 doi: 10.1109/ISIT.2016.7541293 – volume: 13 start-page: 519 year: 2009 ident: 15936_CR16 publication-title: IEEE Commun. Lett. doi: 10.1109/LCOMM.2009.090428 – ident: 15936_CR13 doi: 10.1109/ISCAS.2016.7538902 – volume: 92 start-page: 517 year: 2020 ident: 15936_CR20 publication-title: J. Signal Process. Syst. doi: 10.1007/s11265-019-01506-0 – ident: 15936_CR11 doi: 10.1109/ACSSC.2015.7421362 |
| SSID | ssj0000529419 |
| Score | 2.457486 |
| Snippet | Polar codes are the only error-correcting codes that have been mathematically proven to achieve the Shannon limit to date, playing a crucial role in the... Abstract Polar codes are the only error-correcting codes that have been mathematically proven to achieve the Shannon limit to date, playing a crucial role in... |
| SourceID | doaj pubmedcentral proquest pubmed crossref springer |
| SourceType | Open Website Open Access Repository Aggregation Database Index Database Publisher |
| StartPage | 30848 |
| SubjectTerms | 639/166/987 639/766/259 Algorithms Channel coding Codes Coding theory Communications systems Construction Data transmission Delayed decoding Humanities and Social Sciences Latency LSD algorithm Mathematical analysis multidisciplinary Polar codes Science Science (multidisciplinary) SD algorithm |
| SummonAdditionalLinks | – databaseName: DOAJ Directory of Open Access Journals dbid: DOA link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3NaxUxEB-kVPAiWr9Wa4ngTUOzSfYlObZi8SDFg0LxEvK1-LDsK--1Qv97Z7L7Xvv8wIuXPSRZGGYmmd-QzG8AXiOiyKqzjrdZZo6IWHNno-FdNCLnnHIwtVD4ozk9tWdn7tOtVl_0JmykBx4VdxgCulzKSsgctO5c0BjjZReFE67kXBMfRD23kqmR1Vs63bqpSkYoe7jCSEXVZLLjLXWx42orElXC_j-hzN8fS_5yY1oD0ckDuD8hSHY0Sv4Q7pRhD-6OPSWvH8HXI5au0_k8sWWhCjE6PRlaJn1nxAaZGTFXUsBiaXHDHsvGTtIMISw7R8uzFdENFHZBmS_LhSrfl4_hy8n7z-8-8KmBAk_a6UuuW4z_JoZQXMHNgN-cMOeadTjSJ9O63qpoddK6b2VvUtAB4VMqfUwR05CZegI7w2Ioz4ClWVYx0nW1QgRlZMyuuNT3sg1xhj808GatTH8x8mT4er-trB9V71H1vqreqwaOSd-blcRxXQfQ8n6yvP-X5RvYX1vLTxtv5QkfaqIhlA282kzjlqF7kDCUxVVdQyT1VugGno7G3UiiBYVr0TVgt8y-Jer2zDD_Vmm5EQMYxD8o19u1h9zI9XddPP8fungB9yS5tsBjT-7DDnpPeQm76cflfLU8qHvjJ3DRElk priority: 102 providerName: Directory of Open Access Journals |
| Title | A cyclic redundancy check aided encoding construction method for list sphere polar decoder |
| URI | https://link.springer.com/article/10.1038/s41598-025-15936-3 https://www.ncbi.nlm.nih.gov/pubmed/40847105 https://www.proquest.com/docview/3242403712 https://www.proquest.com/docview/3246324804 https://pubmed.ncbi.nlm.nih.gov/PMC12373811 https://doaj.org/article/aa322cd302da4459a455125b0909edd1 |
| Volume | 15 |
| WOSCitedRecordID | wos001587718700008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 2045-2322 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000529419 issn: 2045-2322 databaseCode: DOA dateStart: 20110101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 2045-2322 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000529419 issn: 2045-2322 databaseCode: M~E dateStart: 20110101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre – providerCode: PRVPQU databaseName: Biological Science Database customDbUrl: eissn: 2045-2322 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000529419 issn: 2045-2322 databaseCode: M7P dateStart: 20110101 isFulltext: true titleUrlDefault: http://search.proquest.com/biologicalscijournals providerName: ProQuest – providerCode: PRVPQU databaseName: Health & Medical Collection customDbUrl: eissn: 2045-2322 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000529419 issn: 2045-2322 databaseCode: 7X7 dateStart: 20110101 isFulltext: true titleUrlDefault: https://search.proquest.com/healthcomplete providerName: ProQuest – providerCode: PRVPQU databaseName: Proquest Central customDbUrl: eissn: 2045-2322 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000529419 issn: 2045-2322 databaseCode: BENPR dateStart: 20110101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Publicly Available Content Database customDbUrl: eissn: 2045-2322 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000529419 issn: 2045-2322 databaseCode: PIMPY dateStart: 20110101 isFulltext: true titleUrlDefault: http://search.proquest.com/publiccontent providerName: ProQuest – providerCode: PRVPQU databaseName: Science Database customDbUrl: eissn: 2045-2322 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000529419 issn: 2045-2322 databaseCode: M2P dateStart: 20110101 isFulltext: true titleUrlDefault: https://search.proquest.com/sciencejournals providerName: ProQuest |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9NAEB7RBKReeFMMJVokbmDVXq-z3hNqUSuQaGQhkAIXa1-GiMoOcUHqv2dm7SQKrwuXOfgh7Xpmdr7d8XwD8AwRhcvyQsWp4y5GRCxiVRgZ50YmzjnrtAyFwm_lbFbM56ocDty64bfK9ZoYFmrXWjojP6LAL4hfjr9cfoupaxRlV4cWGnswJqYyMYLxyemsfLc5ZaE8lkjVUC2TZMVRhxGLqsp4HqfUzS7OdiJSIO7_E9r8_afJXzKnISCd3frfqdyGmwMUZce97dyBa765Czf65pRX9-DTMbNX9mJh2cpTqRktwwxVbL8yopV0jCgwKfIx225paFnfkpohFmYXaEKsI94Cz5a0hWbOUwn96j58ODt9_-p1PHRiiK1Q4jIWKQIJabT2yqNXoXQWN2_THK_UVqaqLjJTCCtEnfJaWi004jDra2MN7mem2QMYNW3jHwKzU5cZQ3nvDKGY5MYpr2xd81SbKb4QwfO1NqplT7hRhUR5VlS97irUXRV0V2URnJDCNk8SWXa40K4-V4PvVVrjqmVdlnCnhciVFggTeW4SleBEXBrB4VpP1eDBXbVVUgRPN7fR9yihohvffg_PENt9kYgIDnrr2IxEJBT3kzyCYsdudoa6e6dZfAn83ggmJAIpHNeLtYltx_X3b_Ho39N4DPucrD7BlZEfwgjtwj-B6_bH5aJbTWBPzmWQxWRwokk4n0B5zkuSEuW4fHNefvwJ768obA |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9QwEB6VAoIL70eggJHgBFETx1nHB4TKo2rVZcWhSCsuxq_QVavNsimg_VP8Rmby2NXyuvXAJYe8ZCefZz57PN8APEFG4bO8UHHquY-REYtYFVbGuZWJ9955I5tE4aEcjYrxWL3fgB99Lgxtq-xtYmOofeVojXybHL8gfTn-cvYlpqpRFF3tS2i0sDgIi-84Zatf7L_B__uU8923h6_34q6qQOyEEqexSNEpSmtMUAERgkfvcCIyyPFM6WSqyiKzhXBClCkvpTPCIKdwobTOIjcfZPjec3Ae7bikLWRyLJdrOhQ1E6nqcnOSrNiu0T9SDhvP45Rq58XZmv9rygT8idv-vkXzlzht4_52r_5vH-4aXOmINttpR8Z12AjTG3CxLb25uAkfd5hbuJOJY_NAiXTkZBgC2B0zEs30jAQ-ya8zV61EdllbcJsh02cnOEBYTaoMgc1ogYD5QAIB81vw4Uw6dhs2p9U03AXmBj6zlqL6GRJNya1XQbmy5KmxA3wggmf939ezVk5EN9sAskK3WNGIFd1gRWcRvCKALO8kKfDmRDX_rDvLoo1Bm-x8lnBvhMiVEUiCeW4TlWBHfBrBVo8L3dmnWq9AEcHj5WW0LBQuMtNQfW3uIS3_IhER3GnRuGyJSIjVJHkExRpO15q6fmU6OWrUy5EqSaSJ2K7nPaRX7fr7t7j37248gkt7h--Gerg_OrgPlzmNuAR9AN-CTcRIeAAX3LfTST1_2AxZBp_OGuo_AQrAf6Y |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lj9MwEB4ty0NceD8CCxgJTmA1cZwmPiC0sFSsdql6AGnFxfgVqFg1pVlA_Wv8OmbyaFVetz1w6SFJKzv9Zuazx_MNwCNkFD7NCsUTLzxHRiy5KmzOM5vH3nvnTd4UCh_m43FxdKQmW_Cjr4WhY5W9T2wcta8c7ZEPKPBL0pcTg7I7FjHZGz2ff-HUQYoyrX07jRYiB2H5HZdv9bP9PfyvHwsxevX25WvedRjgTip5wmWCATK3xgQVEC346R0uSoYZXildnqiySG0hnZRlIsrcGWmQX7hQWmeRpw9T_N0zcDaXWUbW9UZMVvs7lEGTierqdOK0GNQYK6meTWQ8oT56PN2IhU3LgD_x3N-Pa_6Ss21C4ejy__wSr8CljoCz3dZirsJWmF2D821LzuV1eL_L3NIdTx1bBCqwo-DDENjuMyMxTc9I-JPiPXPVWnyXtY24Ga4A2DEaDqtJrSGwOW0cMB9IOGBxA96dysRuwvasmoXbwNzQp9ZStj9FApoL61VQrixFYuwQvxDBkx4Jet7KjOjmeEBa6BY3GnGjG9zoNIIXBJbVkyQR3lyoFh9153G0MeirnU9j4Y2UmTIIUmSzNlYxTsQnEez0GNGd36r1GiARPFzdRo9DaSQzC9XX5hnS-C9iGcGtFpmrkciY2E6cRVBsYHZjqJt3ZtNPjao5Uqgc6SOO62kP7_W4_v4u7vx7Gg_gAiJcH-6PD-7CRUHGF2NoEDuwjRAJ9-Cc-3YyrRf3G-tl8OG0kf4ThDGIcw |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+cyclic+redundancy+check+aided+encoding+construction+method+for+list+sphere+polar+decoder&rft.jtitle=Scientific+reports&rft.au=Hu%2C+Wenbin&rft.au=Chen%2C+Haiqiang&rft.au=Wang%2C+Rui&rft.au=Guo%2C+Qinhua&rft.date=2025-08-22&rft.pub=Nature+Publishing+Group+UK&rft.eissn=2045-2322&rft.volume=15&rft.issue=1&rft_id=info:doi/10.1038%2Fs41598-025-15936-3&rft.externalDocID=10_1038_s41598_025_15936_3 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2045-2322&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2045-2322&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2045-2322&client=summon |