Adaptive Segmented Aggregation and Rate Assignment Techniques for Flexible-Length Polar Codes
Polar codes have garnered a lot of attention from the scientific community, owing to their low-complexity implementation and provable capacity achieving capability. They have been standardized to be used for encoding information on the control channels in 5G wireless networks due to their robustness...
Uloženo v:
| Vydáno v: | Entropy (Basel, Switzerland) Ročník 26; číslo 7; s. 584 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Switzerland
MDPI AG
01.07.2024
|
| Témata: | |
| ISSN: | 1099-4300, 1099-4300 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Polar codes have garnered a lot of attention from the scientific community, owing to their low-complexity implementation and provable capacity achieving capability. They have been standardized to be used for encoding information on the control channels in 5G wireless networks due to their robustness for short codeword lengths. The conventional approach to generate polar codes is to recursively use 2×2 kernels and polarize channel capacities. This approach however, has a limitation of only having the ability to generate codewords of length Norig=2n form. In order to mitigate this limitation, multiple techniques have been developed, e.g., polarization kernels of larger sizes, multi-kernel polar codes, and downsizing techniques like puncturing or shortening. However, the availability of so many design options and parameters, in turn makes the choice of design parameters quite challenging. In this paper, the authors propose a novel polar code construction technique called Adaptive Segmented Aggregation which generates polar codewords of any arbitrary codeword length. This approach involves dividing the entire codeword into smaller segments that can be independently encoded and decoded, thereby aggregated for channel processing. Additionally a rate assignment methodology has been derived for the proposed technique, that is tuned to the design requirement. |
|---|---|
| AbstractList | Polar codes have garnered a lot of attention from the scientific community, owing to their low-complexity implementation and provable capacity achieving capability. They have been standardized to be used for encoding information on the control channels in 5G wireless networks due to their robustness for short codeword lengths. The conventional approach to generate polar codes is to recursively use 2×2 kernels and polarize channel capacities. This approach however, has a limitation of only having the ability to generate codewords of length Norig=2n form. In order to mitigate this limitation, multiple techniques have been developed, e.g., polarization kernels of larger sizes, multi-kernel polar codes, and downsizing techniques like puncturing or shortening. However, the availability of so many design options and parameters, in turn makes the choice of design parameters quite challenging. In this paper, the authors propose a novel polar code construction technique called Adaptive Segmented Aggregation which generates polar codewords of any arbitrary codeword length. This approach involves dividing the entire codeword into smaller segments that can be independently encoded and decoded, thereby aggregated for channel processing. Additionally a rate assignment methodology has been derived for the proposed technique, that is tuned to the design requirement. Polar codes have garnered a lot of attention from the scientific community, owing to their low-complexity implementation and provable capacity achieving capability. They have been standardized to be used for encoding information on the control channels in 5G wireless networks due to their robustness for short codeword lengths. The conventional approach to generate polar codes is to recursively use 2×2 kernels and polarize channel capacities. This approach however, has a limitation of only having the ability to generate codewords of length Norig=2n form. In order to mitigate this limitation, multiple techniques have been developed, e.g., polarization kernels of larger sizes, multi-kernel polar codes, and downsizing techniques like puncturing or shortening. However, the availability of so many design options and parameters, in turn makes the choice of design parameters quite challenging. In this paper, the authors propose a novel polar code construction technique called Adaptive Segmented Aggregation which generates polar codewords of any arbitrary codeword length. This approach involves dividing the entire codeword into smaller segments that can be independently encoded and decoded, thereby aggregated for channel processing. Additionally a rate assignment methodology has been derived for the proposed technique, that is tuned to the design requirement.Polar codes have garnered a lot of attention from the scientific community, owing to their low-complexity implementation and provable capacity achieving capability. They have been standardized to be used for encoding information on the control channels in 5G wireless networks due to their robustness for short codeword lengths. The conventional approach to generate polar codes is to recursively use 2×2 kernels and polarize channel capacities. This approach however, has a limitation of only having the ability to generate codewords of length Norig=2n form. In order to mitigate this limitation, multiple techniques have been developed, e.g., polarization kernels of larger sizes, multi-kernel polar codes, and downsizing techniques like puncturing or shortening. However, the availability of so many design options and parameters, in turn makes the choice of design parameters quite challenging. In this paper, the authors propose a novel polar code construction technique called Adaptive Segmented Aggregation which generates polar codewords of any arbitrary codeword length. This approach involves dividing the entire codeword into smaller segments that can be independently encoded and decoded, thereby aggregated for channel processing. Additionally a rate assignment methodology has been derived for the proposed technique, that is tuned to the design requirement. Polar codes have garnered a lot of attention from the scientific community, owing to their low-complexity implementation and provable capacity achieving capability. They have been standardized to be used for encoding information on the control channels in 5G wireless networks due to their robustness for short codeword lengths. The conventional approach to generate polar codes is to recursively use 2×2 kernels and polarize channel capacities. This approach however, has a limitation of only having the ability to generate codewords of length N[sub.orig] =2[sup.n] form. In order to mitigate this limitation, multiple techniques have been developed, e.g., polarization kernels of larger sizes, multi-kernel polar codes, and downsizing techniques like puncturing or shortening. However, the availability of so many design options and parameters, in turn makes the choice of design parameters quite challenging. In this paper, the authors propose a novel polar code construction technique called Adaptive Segmented Aggregation which generates polar codewords of any arbitrary codeword length. This approach involves dividing the entire codeword into smaller segments that can be independently encoded and decoded, thereby aggregated for channel processing. Additionally a rate assignment methodology has been derived for the proposed technique, that is tuned to the design requirement. |
| Audience | Academic |
| Author | Saha, Souradip Gerstacker, Wolfgang Adrat, Marc Mahajan, Shubham |
| Author_xml | – sequence: 1 givenname: Souradip surname: Saha fullname: Saha, Souradip – sequence: 2 givenname: Shubham surname: Mahajan fullname: Mahajan, Shubham – sequence: 3 givenname: Marc surname: Adrat fullname: Adrat, Marc – sequence: 4 givenname: Wolfgang surname: Gerstacker fullname: Gerstacker, Wolfgang |
| BackLink | https://www.ncbi.nlm.nih.gov/pubmed/39056946$$D View this record in MEDLINE/PubMed |
| BookMark | eNpdkk2LFDEQhoOsuB968A9Igxc99JqP7nwcm8HVhQFF16M06aTSm6E7GZOeRf-9GXsdROqQonjqrbxUXaKzEAMg9JLga8YUfgeUY4Fb2TxBFwQrVTcM47N_8nN0mfMOY8oo4c_QeWlquWr4BfreWb1f_ANUX2GcISxgq24cE4x68TFUOtjqi16g6nL2YzgS1R2Y--B_HCBXLqbqZoKffpig3kIYl_vqc5x0qjbRQn6Onjo9ZXjx-F6hbzfv7zYf6-2nD7ebblubhrClttTCQBrlhOOOqWZopVWUNK2gasCaOoaVVoYM1hjmjJDEioZrSZ3lamgVu0K3q66Netfvk591-tVH7fs_hZjGXqfFmwl6cMYOThJNhW4kF1K3eiAtYSAHISgpWm9WrX2KR49LP_tsYJp0gHjIPcOyEaLMpwV9_R-6i4cUitOVkoTL4-euV2rUZb4PLi5JmxIWZm_KJp0v9U5iJrjibVsaXj3KHoYZ7MnP360V4O0KmBRzTuBOCMH98SL600Ww36DVpWs |
| Cites_doi | 10.1109/TIT.2015.2410251 10.1109/ICMCIS52405.2021.9486401 10.1109/ACSSC.2014.7094848 10.1109/TCOMM.2020.3006212 10.1109/LCOMM.2014.2364845 10.1134/S0032946023010039 10.1109/LWC.2020.3006759 10.1109/ITW.2017.8277949 10.1109/ICCW.2017.7962750 10.1109/TCOMM.2021.3120274 10.1109/TIT.2009.2021379 10.1109/GLOCOM.2017.8254147 10.1109/ICSPCS50536.2020.9310019 10.1109/ISIT.2019.8849213 10.1109/VTCSpring.2019.8746303 10.3844/jmssp.2013.238.248 10.1109/ISTC.2018.8625319 10.1109/TIT.2015.2453312 10.1109/TVT.2015.2443772 10.1109/ISTC.2018.8625378 10.1109/ICSPCS53099.2021.9660284 |
| ContentType | Journal Article |
| Copyright | COPYRIGHT 2024 MDPI AG 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| Copyright_xml | – notice: COPYRIGHT 2024 MDPI AG – notice: 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| DBID | AAYXX CITATION NPM 7TB 8FD 8FE 8FG ABJCF ABUWG AFKRA AZQEC BENPR BGLVJ CCPQU DWQXO FR3 HCIFZ KR7 L6V M7S PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI PTHSS 7X8 DOA |
| DOI | 10.3390/e26070584 |
| DatabaseName | CrossRef PubMed Mechanical & Transportation Engineering Abstracts Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland ProQuest Central Essentials ProQuest Central Technology Collection ProQuest One ProQuest Central Engineering Research Database SciTech Premium Collection Civil Engineering Abstracts ProQuest Engineering Collection Engineering Database ProQuest Central Premium ProQuest One Academic (New) ProQuest Publicly Available Content Database ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition Engineering Collection MEDLINE - Academic DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef PubMed Publicly Available Content Database Technology Collection Technology Research Database ProQuest One Academic Middle East (New) Mechanical & Transportation Engineering Abstracts ProQuest Central Essentials ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Central ProQuest One Applied & Life Sciences ProQuest Engineering Collection ProQuest Central Korea ProQuest Central (New) Engineering Collection Civil Engineering Abstracts Engineering Database ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection ProQuest One Academic UKI Edition Materials Science & Engineering Collection Engineering Research Database ProQuest One Academic ProQuest One Academic (New) MEDLINE - Academic |
| DatabaseTitleList | PubMed CrossRef MEDLINE - Academic Publicly Available Content Database |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Open Access Full Text 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 url: http://search.proquest.com/publiccontent sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| EISSN | 1099-4300 |
| ExternalDocumentID | oai_doaj_org_article_efcdbf81a27a48678a5ab1513e8b7721 A803769655 39056946 10_3390_e26070584 |
| Genre | Journal Article |
| GeographicLocations | Germany |
| GeographicLocations_xml | – name: Germany |
| GroupedDBID | 29G 2WC 5GY 5VS 8FE 8FG AADQD AAFWJ AAYXX ABDBF ABJCF ACIWK ACUHS ADBBV AEGXH AENEX AFFHD AFKRA AFPKN AFZYC ALMA_UNASSIGNED_HOLDINGS BCNDV BENPR BGLVJ CCPQU CITATION CS3 DU5 E3Z ESX F5P GROUPED_DOAJ GX1 HCIFZ HH5 IAO ITC J9A KQ8 L6V M7S MODMG M~E OK1 OVT PGMZT PHGZM PHGZT PIMPY PQGLB PROAC PTHSS RNS RPM TR2 TUS XSB ~8M NPM 7TB 8FD ABUWG AZQEC DWQXO FR3 KR7 PKEHL PQEST PQQKQ PQUKI 7X8 PUEGO |
| ID | FETCH-LOGICAL-c413t-d2deb149f7f6f394b58d92145729b0a2f309a9c1bdcc3fc781d746a82fd69b593 |
| IEDL.DBID | DOA |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001277345300001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1099-4300 |
| IngestDate | Mon Nov 10 04:25:49 EST 2025 Thu Sep 04 17:44:11 EDT 2025 Fri Jul 25 11:59:52 EDT 2025 Tue Nov 04 18:18:27 EST 2025 Mon Jul 21 06:08:55 EDT 2025 Sat Nov 29 07:13:46 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 7 |
| Keywords | rate-assignment puncturing polar codes shortening adaptive segmented aggregation |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c413t-d2deb149f7f6f394b58d92145729b0a2f309a9c1bdcc3fc781d746a82fd69b593 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 |
| OpenAccessLink | https://doaj.org/article/efcdbf81a27a48678a5ab1513e8b7721 |
| PMID | 39056946 |
| PQID | 3084781689 |
| PQPubID | 2032401 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_efcdbf81a27a48678a5ab1513e8b7721 proquest_miscellaneous_3084777462 proquest_journals_3084781689 gale_infotracacademiconefile_A803769655 pubmed_primary_39056946 crossref_primary_10_3390_e26070584 |
| PublicationCentury | 2000 |
| PublicationDate | 2024-07-01 |
| PublicationDateYYYYMMDD | 2024-07-01 |
| PublicationDate_xml | – month: 07 year: 2024 text: 2024-07-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationPlace | Switzerland |
| PublicationPlace_xml | – name: Switzerland – name: Basel |
| PublicationTitle | Entropy (Basel, Switzerland) |
| PublicationTitleAlternate | Entropy (Basel) |
| PublicationYear | 2024 |
| Publisher | MDPI AG |
| Publisher_xml | – name: MDPI AG |
| References | Arikan (ref_1) 2009; 55 Tal (ref_3) 2015; 61 Bioglio (ref_10) 2020; 68 ref_14 ref_13 ref_12 Mahdavifar (ref_6) 2016; 65 ref_11 ref_21 Liao (ref_24) 2022; 70 ref_20 Rushdi (ref_22) 2013; 9 ref_2 ref_19 Wang (ref_16) 2014; 18 ref_17 ref_15 Trifonov (ref_23) 2023; 59 ref_8 ref_5 ref_4 Xia (ref_9) 2020; 9 ref_7 Miloslavskaya (ref_18) 2015; 61 |
| References_xml | – volume: 61 start-page: 2213 year: 2015 ident: ref_3 article-title: List Decoding of Polar Codes publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2015.2410251 – ident: ref_20 doi: 10.1109/ICMCIS52405.2021.9486401 – ident: ref_4 doi: 10.1109/ACSSC.2014.7094848 – volume: 68 start-page: 5350 year: 2020 ident: ref_10 article-title: Multi-Kernel Polar Codes: Concept and Design Principles publication-title: IEEE Trans. Commun. doi: 10.1109/TCOMM.2020.3006212 – ident: ref_5 – ident: ref_2 – volume: 18 start-page: 2081 year: 2014 ident: ref_16 article-title: A Novel Puncturing Scheme for Polar Codes publication-title: IEEE Commun. Lett. doi: 10.1109/LCOMM.2014.2364845 – volume: 59 start-page: 22 year: 2023 ident: ref_23 article-title: Design and Decoding of Polar Codes with Large Kernels: A Survey publication-title: Probl. Inf. Transm. doi: 10.1134/S0032946023010039 – volume: 9 start-page: 1879 year: 2020 ident: ref_9 article-title: Construction of Multi-Kernel Polar Codes with Kernel Substitution publication-title: IEEE Wirel. Commun. Lett. doi: 10.1109/LWC.2020.3006759 – ident: ref_11 doi: 10.1109/ITW.2017.8277949 – ident: ref_7 doi: 10.1109/ICCW.2017.7962750 – volume: 70 start-page: 185 year: 2022 ident: ref_24 article-title: Construction of Polar Codes with Reinforcement Learning publication-title: IEEE Trans. Commun. doi: 10.1109/TCOMM.2021.3120274 – volume: 55 start-page: 3051 year: 2009 ident: ref_1 article-title: Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2009.2021379 – ident: ref_12 doi: 10.1109/GLOCOM.2017.8254147 – ident: ref_19 doi: 10.1109/ICSPCS50536.2020.9310019 – ident: ref_15 doi: 10.1109/ISIT.2019.8849213 – ident: ref_17 – ident: ref_8 doi: 10.1109/VTCSpring.2019.8746303 – volume: 9 start-page: 238 year: 2013 ident: ref_22 article-title: On Self-Inverse Binary Matrices over the Binary Galois Field publication-title: J. Math. Stat. doi: 10.3844/jmssp.2013.238.248 – ident: ref_13 doi: 10.1109/ISTC.2018.8625319 – volume: 61 start-page: 4852 year: 2015 ident: ref_18 article-title: Shortened Polar Codes publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2015.2453312 – volume: 65 start-page: 3115 year: 2016 ident: ref_6 article-title: Polar Coding for Bit-Interleaved Coded Modulation publication-title: IEEE Trans. Veh. Technol. doi: 10.1109/TVT.2015.2443772 – ident: ref_14 doi: 10.1109/ISTC.2018.8625378 – ident: ref_21 doi: 10.1109/ICSPCS53099.2021.9660284 |
| SSID | ssj0023216 |
| Score | 2.3422482 |
| Snippet | Polar codes have garnered a lot of attention from the scientific community, owing to their low-complexity implementation and provable capacity achieving... |
| SourceID | doaj proquest gale pubmed crossref |
| SourceType | Open Website Aggregation Database Index Database |
| StartPage | 584 |
| SubjectTerms | adaptive segmented aggregation Analysis Codes Coding theory Design parameters Downsizing Electronic data processing Methods polar codes puncturing rate-assignment Robust control shortening Transmitters Wireless networks |
| SummonAdditionalLinks | – databaseName: Engineering Database dbid: M7S link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9QwELagcODCQ7xSCjIIiVPUxI4d-4SWihWHqqpoQb0gy8-0EkqWTdrfz9jxBgESF65JFNn-PONv7PE3CL31ramDjkf-GmBovLGlcI6VNjhZBdoIn2osfT1uT07ExYU8zRtuY06r3PnE5KjdYOMe-SGtRLwVyYV8v_lRxqpR8XQ1l9C4je5ElQSSUvfOloCLkprPakIUQvtDD9y9rZhofluDklT_3w75D5qZlpv1g_9t6EN0PxNNvJpnxiN0y_eP0beV05vo4PCZ75Icp8OrDkLuLgGEde_wZ2CfGFC76lKiAD7fqbyOGAguXkcFTfPdl8e-76ZLfBpjY3w0OD8-QV_WH8-PPpW5wEJpYe2aSkccuOpGhjbwQGVjmHAySpcD4zaVJoFWUktbG2ctDRZ65dqGa0GC49IwSZ-ivX7o_XOEaaiCNsBNLAE34BoTqCXBcGMJC8ADCvRmN-RqM-toKIg_Ii5qwaVAHyIYywdR-jo9GLadypakfLDOBFFr0uooFyg00wZ4C_XCQKhQF-hdhFJFA5222up8zwDaGaWu1EpU4FQlZ6xABzsEVbbcUf2Cr0Cvl9dgc_EgRfd-uM7fAG_mpEDP5lmytBk6xLhs-P6_f_4C3SMwLHPi7wHam7bX_iW6a2-mq3H7Kk3jn0B__Oc priority: 102 providerName: ProQuest |
| Title | Adaptive Segmented Aggregation and Rate Assignment Techniques for Flexible-Length Polar Codes |
| URI | https://www.ncbi.nlm.nih.gov/pubmed/39056946 https://www.proquest.com/docview/3084781689 https://www.proquest.com/docview/3084777462 https://doaj.org/article/efcdbf81a27a48678a5ab1513e8b7721 |
| Volume | 26 |
| WOSCitedRecordID | wos001277345300001&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 Open Access Full Text customDbUrl: eissn: 1099-4300 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0023216 issn: 1099-4300 databaseCode: DOA dateStart: 20160101 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: 1099-4300 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0023216 issn: 1099-4300 databaseCode: M~E dateStart: 19990101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre – providerCode: PRVPQU databaseName: Engineering Database customDbUrl: eissn: 1099-4300 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0023216 issn: 1099-4300 databaseCode: M7S dateStart: 19990301 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest customDbUrl: eissn: 1099-4300 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0023216 issn: 1099-4300 databaseCode: BENPR dateStart: 19990301 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Publicly Available Content customDbUrl: eissn: 1099-4300 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0023216 issn: 1099-4300 databaseCode: PIMPY dateStart: 19990301 isFulltext: true titleUrlDefault: http://search.proquest.com/publiccontent providerName: ProQuest |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1Lb9QwEB5B4cAFgXiFlpVBSJyiZu3YsY_balcglVXUFrQcUORnqISy1W7aI7-dsZNd8Thw4ZJD7IP9jWfmG9n-DPDWV2YadNzy12iG0hubS-d4boNTRWCl9OmNpc9n1XIpVytV__LUVzwTNsgDD8Ad-2CdCXKqaaWjOpzUXBtMU8xLg8wwFT7IenbF1FhqMToVg44Qw6L-2CNrrwouy9-yTxLp_zsU_0EwU6JZPIKHI0Mks2Fkj-GO757A15nT1zEykQvfJh1NR2Yt1sptQpbozpFzpI0E4b5q0w4_udzJs24JMlOyiNKX5rvPz3zX9t9IHYtacrp2fvsUPi3ml6fv8_FlhNxi0ulzRx3G2FKFKojAVGm4dCpqjiNVNoWmgRVKKzs1zloWbIWktCqFljQ4oQxX7BkcdOvOvwDCQhG0QVJhKfqvK01glgYjjKU8YALP4M0OseZ6EMBosHCIsDZ7WDM4iVjuO0TN6vQDLdmMlmz-ZckM3kVLNNGz-o22erwggOOMGlXNTBYYDZXgPIOjnbGa0eW2DStkvDYrpMrg9b4ZnSXugOjOr2_GPkh4Bc3g-WDk_ZhxQlyoUrz8H3M5hAcUwRvO9R7BQb-58a_gvr3tr7abCdytVnIC907my_p8klbuJB46vYjfH3NsqT98rL_8BBsQ9Xo |
| linkProvider | Directory of Open Access Journals |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9QwELaqggQXHuIVKGAQiFPUxE4c-4DQUli16rKq6IJ6QcbPUAklS5KC-FP8RsZ5LAIkbj1wTazE9nz5Zia2v0HoiSt06lVY8ldghsxpE3Nr89h4KxJPM-76GkvvF8VyyU9OxNEW-jGdhQnbKidO7Ina1ib8I9-lCQ-nIhkXL9Zf4lA1KqyuTiU0Blgcuu_fIGVrnx-8Avs-JWT-erW3H49VBWIDhN3Flljgp0z4wjNPRaZzbkXQ64YwUyeKeJoIJUyqrTHUG3inLTKmOPGWCZ0H8SWg_AtZYP9-q-DxJsGjJGWDehGlItl1kCsUSc6z33xeXxrgbwfwR1jbu7f51f9tYq6hK2MgjWcD8q-jLVfdQB9mVq0DgeNjV_ZyoxbPyrJxZQ9ArCqL30J0jQGVp2W_EQKvJhXbFkMAj-dBIVR_dvHCVWX3CR-F3B_v1da1N9G7cxnRLbRd1ZW7gzD1iVcaYi9DgOZspj01xGumDck9xDkRejyZWK4HnRAJ-VXAgdzgIEIvg_E3DYK0d3-hbko5MoV03ljteapIoYIcIle50hCXUcc1pEJphJ4F6MhAQF2jjBrPUUA_g5SXnPEEnIZgeR6hnQkxcmSmVv6CS4QebW4Dp4SFIlW5-mxsA3kBIxG6PaBy02cYUM5Exu7---EP0aX91ZuFXBwsD--hywSmaNjkvIO2u-bM3UcXzdfutG0e9J8QRh_PG5o_AWHCWl8 |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3LjtMwFL0adRBiw0O8AgMYBGIVNbXzsBcIlRkqqilVBQMaFqPgZxgJpSXNgPg1vo7rvBAgsZsF28RK4vjk-Nz4-lyAxzZTEyf9kr_EYYit0iE3Jgm1MyJyLOa2qbH0fpEtl_z4WKx24Ee_F8anVfac2BC1WWv_j3zMIu53RaZcjF2XFrE6mD3ffAl9BSm_0tqX02ghcmi_f8PwbftsfoBj_YTS2cuj_VdhV2Eg1EjedWioQa6Khctc6piIVcKN8N7dKDlVJKljkZBCT5TRmjmN9zdZnEpOnUmFSrwRE9L_LkryOB7B7mr-evVhCPcYnaStlxFjIhpbjByyKOHxbzNgUyjg7-ngD5HbTHazK__za7oKlzuJTabtN3ENdmx5HU6mRm48tZO3tmiMSA2ZFkVliwaaRJaGvEHdTRCvp0WTIkGOen_bLUFpT2beO1R9tuHClkX9iaz8XwGyvzZ2ewPenUuPbsKoXJf2NhDmIicVqjJNkQBNrBzT1KlUaZo4VEABPOqHO9-0DiI5Rl4eE_mAiQBeeCAMDbzpd3NgXRV5xyG5ddooxyeSZtIbJXKZSIWKjVmuMEiaBPDUwyj31FRXUstuhwU-pzf5yqc8wulEpEkSwF6PnrzjrG3-CzoBPBxOI9v4JSRZ2vVZ1wYjhpQGcKtF6PDM2KEkFXF6598XfwAXEZH5Yr48vAuXKL6hNvt5D0Z1dWbvwQX9tT7dVve774nAx_PG5k9jPmSf |
| 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=Adaptive+Segmented+Aggregation+and+Rate+Assignment+Techniques+for+Flexible-Length+Polar+Codes&rft.jtitle=Entropy+%28Basel%2C+Switzerland%29&rft.au=Saha%2C+Souradip&rft.au=Mahajan%2C+Shubham&rft.au=Adrat%2C+Marc&rft.au=Gerstacker%2C+Wolfgang&rft.date=2024-07-01&rft.issn=1099-4300&rft.eissn=1099-4300&rft.volume=26&rft.issue=7&rft_id=info:doi/10.3390%2Fe26070584&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1099-4300&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1099-4300&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1099-4300&client=summon |