Constructing Grith Eight GC-LDPC Codes Based on the GCD FLRM Matrix with a New Lower Bound
By connecting multiple short, local low-density parity-check (LDPC) codes with a global parity check, the globally coupled (GC) LDPC code can attain high performances with low complexities. The typical design of a local code is a quasi-cyclic (QC) LDPC for which the code length is proportional to th...
Saved in:
Published in | Sensors (Basel, Switzerland) Vol. 22; no. 19; p. 7335 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
Basel
MDPI AG
27.09.2022
MDPI |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | By connecting multiple short, local low-density parity-check (LDPC) codes with a global parity check, the globally coupled (GC) LDPC code can attain high performances with low complexities. The typical design of a local code is a quasi-cyclic (QC) LDPC for which the code length is proportional to the size of circulant permutation matrix (CPM). The greatest common divisor (GCD)-based full-length row multiplier (FLRM) matrix is constrained by a lower bound of CPM size to avoid six length cycles. In this paper, we find a new lower bound for the CPM size and propose an algorithm to determine the minimum CPM size and the corresponding FLRM matrix. Based on the new lower bound, two methods are proposed to construct the GC-QC-LDPC code of grith 8 based on the GCD based FLRM matrix. With the proposed algorithm, the CPM size can be 45% less than that given by sufficient condition of girth 8. Compared with the conventional GC-LDPC construction, the codes constructed with the proposed method have improved performance and are more flexible in code length and code rate design. |
---|---|
AbstractList | By connecting multiple short, local low-density parity-check (LDPC) codes with a global parity check, the globally coupled (GC) LDPC code can attain high performances with low complexities. The typical design of a local code is a quasi-cyclic (QC) LDPC for which the code length is proportional to the size of circulant permutation matrix (CPM). The greatest common divisor (GCD)-based full-length row multiplier (FLRM) matrix is constrained by a lower bound of CPM size to avoid six length cycles. In this paper, we find a new lower bound for the CPM size and propose an algorithm to determine the minimum CPM size and the corresponding FLRM matrix. Based on the new lower bound, two methods are proposed to construct the GC-QC-LDPC code of grith 8 based on the GCD based FLRM matrix. With the proposed algorithm, the CPM size can be 45% less than that given by sufficient condition of girth 8. Compared with the conventional GC-LDPC construction, the codes constructed with the proposed method have improved performance and are more flexible in code length and code rate design. |
Audience | Academic |
Author | Zhu, Kun Yang, Hongwen |
AuthorAffiliation | School of Information and Communication, Beijing University of Posts and Telecommunications, Beijing 100876, China |
AuthorAffiliation_xml | – name: School of Information and Communication, Beijing University of Posts and Telecommunications, Beijing 100876, China |
Author_xml | – sequence: 1 givenname: Kun surname: Zhu fullname: Zhu, Kun – sequence: 2 givenname: Hongwen surname: Yang fullname: Yang, Hongwen |
BookMark | eNpdkktv1DAQxyPUij7gwDewxAUOW_zM44LUpu1SKQWE4MLFcuxJ1qus3doOC98eL1tVLfJhrJn__OahOSkOnHdQFG8IPmOswR8ipaSpGBMvimPCKV_UlOKDJ_-j4iTGNcaUMVa_LI5YSVnJGTsufrbexRRmnawb0TLYtEJXdlwltGwX3eXXFrXeQEQXKoJB3qG0ghy6RNfdt1t0q1Kwv9F2l6XQZ9iizm8hoAs_O_OqOBzUFOH1gz0tflxffW8_Lbovy5v2vFtoXou0oECE0FwzqIc8Be4J8L4HwUtTEUyJ4SDKRgtDoDdNbbDmhPK-ElVf46EBdlrc7LnGq7W8C3ajwh_plZX_HD6MUoVk9QSSKy2U6jnH3PCS5FqD0jXleXmNwpxm1sc9627uN2A0uBTU9Az6POLsSo7-l2xERXjNMuDdAyD4-xlikhsbNUyTcuDnKGlFBWkwbuosffufdO3n4PKqdirOMGElzqqzvWpUeQDrBp_r6vwMbKzOdzDY7D-veCkYaciug_f7BB18jAGGx-4JlrtzkY_nwv4C_yquEw |
CitedBy_id | crossref_primary_10_1109_ACCESS_2023_3249464 crossref_primary_10_1109_OJCAS_2024_3363043 |
Cites_doi | 10.1109/MCOM.2014.6852099 10.1109/LCOMM.2014.2349982 10.1109/LCOMM.2021.3120106 10.1109/TCSI.2015.2510619 10.1109/LCOMM.2021.3096386 10.1109/LCOMM.2013.052013.130474 10.1109/LCOMM.2012.090312.121501 10.23919/JCC.2021.01.016 10.1109/ACCESS.2019.2948970 10.1109/TIT.2021.3119384 10.1109/TIT.2018.2879823 10.1587/transcom.2021EBI0001 10.1109/TIT.2011.2176717 10.1007/s11235-019-00630-3 10.3390/s18082418 10.3390/s21062012 10.1109/LCOMM.2014.030114.132853 10.1109/TIT.2019.2896110 10.1109/TCOMM.2019.2944621 10.1109/COMST.2019.2893851 10.1109/TCSI.2018.2875311 10.1109/TCSI.2020.3018048 10.1109/LSP.2017.2688410 10.1109/LCOMM.2012.122012.122292 |
ContentType | Journal Article |
Copyright | COPYRIGHT 2022 MDPI AG 2022 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. 2022 by the authors. 2022 |
Copyright_xml | – notice: COPYRIGHT 2022 MDPI AG – notice: 2022 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. – notice: 2022 by the authors. 2022 |
DBID | AAYXX CITATION 3V. 7X7 7XB 88E 8FI 8FJ 8FK ABUWG AFKRA AZQEC BENPR CCPQU DWQXO FYUFA GHDGH K9. M0S M1P PIMPY PQEST PQQKQ PQUKI PRINS 7X8 5PM DOA |
DOI | 10.3390/s22197335 |
DatabaseName | CrossRef ProQuest Central (Corporate) Health & Medical Collection (Proquest) ProQuest Central (purchase pre-March 2016) Medical Database (Alumni Edition) Hospital Premium Collection Hospital Premium Collection (Alumni Edition) ProQuest Central (Alumni) (purchase pre-March 2016) ProQuest Central (Alumni) ProQuest Central ProQuest Central Essentials ProQuest Central ProQuest One Community College ProQuest Central Korea Health Research Premium Collection Health Research Premium Collection (Alumni) ProQuest Health & Medical Complete (Alumni) Health & Medical Collection (Alumni Edition) PML(ProQuest Medical Library) Publicly Available Content Database ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Academic ProQuest One Academic UKI Edition ProQuest Central China MEDLINE - Academic PubMed Central (Full Participant titles) DOAJ Directory of Open Access Journals |
DatabaseTitle | CrossRef Publicly Available Content Database ProQuest Central Essentials ProQuest One Academic Eastern Edition ProQuest Health & Medical Complete (Alumni) ProQuest Central (Alumni Edition) ProQuest One Community College ProQuest Hospital Collection Health Research Premium Collection (Alumni) ProQuest Central China ProQuest Hospital Collection (Alumni) ProQuest Central ProQuest Health & Medical Complete Health Research Premium Collection ProQuest Medical Library ProQuest One Academic UKI Edition Health and Medicine Complete (Alumni Edition) ProQuest Central Korea ProQuest One Academic ProQuest Medical Library (Alumni) ProQuest Central (Alumni) MEDLINE - Academic |
DatabaseTitleList | CrossRef Publicly Available Content Database |
Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: 7X7 name: Health & Medical Collection (Proquest) url: https://search.proquest.com/healthcomplete sourceTypes: Aggregation Database |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Engineering |
EISSN | 1424-8220 |
ExternalDocumentID | oai_doaj_org_article_4ac5aab4404d4610b1fac8249739a042 A746531913 10_3390_s22197335 |
GroupedDBID | --- 123 2WC 3V. 53G 5VS 7X7 88E 8FE 8FG 8FI 8FJ AADQD AAHBH AAYXX ABDBF ABJCF ABUWG ADBBV AENEX AFKRA AFZYC ALIPV ALMA_UNASSIGNED_HOLDINGS ARAPS BENPR BPHCQ BVXVI CCPQU CITATION CS3 D1I DU5 E3Z EBD ESX F5P FYUFA GROUPED_DOAJ GX1 HCIFZ HH5 HMCUK HYE IAO ITC KB. KQ8 L6V M1P M48 M7S MODMG M~E OK1 P2P P62 PDBOC PIMPY PQQKQ PROAC PSQYO RIG RNS RPM TUS UKHRP XSB ~8M BGLVJ 7XB 8FK AZQEC DWQXO K9. PQEST PQUKI PRINS 7X8 5PM |
ID | FETCH-LOGICAL-c485t-2e155c4c3e8f1970b1e4bbe546d71021d4e569c5d1ebd98d0c4124b757b80f9e3 |
IEDL.DBID | RPM |
ISSN | 1424-8220 |
IngestDate | Tue Oct 22 15:16:02 EDT 2024 Tue Sep 17 21:30:56 EDT 2024 Fri Jun 28 08:32:21 EDT 2024 Mon Oct 21 12:46:14 EDT 2024 Fri Feb 02 04:20:47 EST 2024 Thu Sep 26 20:47:47 EDT 2024 |
IsDoiOpenAccess | true |
IsOpenAccess | true |
IsPeerReviewed | true |
IsScholarly | true |
Issue | 19 |
Language | English |
License | 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/). |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-c485t-2e155c4c3e8f1970b1e4bbe546d71021d4e569c5d1ebd98d0c4124b757b80f9e3 |
Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
ORCID | 0000-0002-7541-8474 0000-0002-1865-5051 |
OpenAccessLink | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9571483/ |
PMID | 36236433 |
PQID | 2724301360 |
PQPubID | 2032333 |
ParticipantIDs | doaj_primary_oai_doaj_org_article_4ac5aab4404d4610b1fac8249739a042 pubmedcentral_primary_oai_pubmedcentral_nih_gov_9571483 proquest_miscellaneous_2725190098 proquest_journals_2724301360 gale_infotracacademiconefile_A746531913 crossref_primary_10_3390_s22197335 |
PublicationCentury | 2000 |
PublicationDate | 20220927 |
PublicationDateYYYYMMDD | 2022-09-27 |
PublicationDate_xml | – month: 9 year: 2022 text: 20220927 day: 27 |
PublicationDecade | 2020 |
PublicationPlace | Basel |
PublicationPlace_xml | – name: Basel |
PublicationTitle | Sensors (Basel, Switzerland) |
PublicationYear | 2022 |
Publisher | MDPI AG MDPI |
Publisher_xml | – name: MDPI AG – name: MDPI |
References | Mohammad (ref_23) 2017; 24 Arora (ref_7) 2020; 73 Mohammad (ref_22) 2013; 17 ref_13 Duffy (ref_2) 2019; 65 Meng (ref_9) 2018; 18 Shao (ref_5) 2019; 21 Ghaffar (ref_20) 2021; 18 Yen (ref_31) 2019; 66 Ali (ref_19) 2019; 65 Guo (ref_16) 2013; 17 Ji (ref_29) 2019; 7 Niu (ref_3) 2012; 16 Alireza (ref_14) 2017; 65 Inseon (ref_15) 2021; 25 Bocharova (ref_32) 2012; 58 Mohammad (ref_21) 2014; 18 ref_25 ref_24 Jian (ref_17) 2014; 18 Daniel (ref_11) 2014; 52 Panteleev (ref_1) 2021; 68 Lu (ref_12) 2016; 63 Guo (ref_18) 2021; 25 ref_28 ref_27 ref_26 ref_8 Vladimir (ref_10) 2020; 67 Takayuki (ref_4) 2022; E105-B ref_6 Ji (ref_30) 2019; 67 |
References_xml | – volume: 52 start-page: 168 year: 2014 ident: ref_11 article-title: Spatially coupled sparse codes on graphs: Theory and practice publication-title: IEEE Commun. Mag. doi: 10.1109/MCOM.2014.6852099 contributor: fullname: Daniel – ident: ref_28 – volume: 18 start-page: 1671 year: 2014 ident: ref_21 article-title: Large Girth Column-Weight Two and Three LDPC Codes publication-title: IEEE Commun. Lett. doi: 10.1109/LCOMM.2014.2349982 contributor: fullname: Mohammad – volume: 25 start-page: 3780 year: 2021 ident: ref_15 article-title: Some New Constructions of Girth-8 QC-LDPC Codes for Future GNSS publication-title: IEEE Commun. Lett. doi: 10.1109/LCOMM.2021.3120106 contributor: fullname: Inseon – ident: ref_24 – ident: ref_26 – volume: 63 start-page: 134 year: 2016 ident: ref_12 article-title: A 3.0 Gb/s Throughput Hardware-Efficient Decoder for Cyclically-Coupled QC-LDPC Codes publication-title: IEEE Trans. Circuits Syst. I Regul. Pap. doi: 10.1109/TCSI.2015.2510619 contributor: fullname: Lu – volume: 25 start-page: 2820 year: 2021 ident: ref_18 article-title: Relation Between GCD Constraint and Full-Length Row-Multiplier QC-LDPC Codes with Girth Eight publication-title: IEEE Commun. Lett. doi: 10.1109/LCOMM.2021.3096386 contributor: fullname: Guo – volume: 17 start-page: 1439 year: 2013 ident: ref_22 article-title: Column-Weight Three QC LDPC Codes with Girth 20 publication-title: IEEE Commun. Lett. doi: 10.1109/LCOMM.2013.052013.130474 contributor: fullname: Mohammad – volume: 16 start-page: 1668 year: 2012 ident: ref_3 article-title: CRC-aided decoding of polar codes publication-title: IEEE Commun. Lett. doi: 10.1109/LCOMM.2012.090312.121501 contributor: fullname: Niu – volume: 18 start-page: 181 year: 2021 ident: ref_20 article-title: Edge coloring of graphs with applications in coding theory publication-title: China Commun. doi: 10.23919/JCC.2021.01.016 contributor: fullname: Ghaffar – volume: 7 start-page: 153853 year: 2019 ident: ref_29 article-title: Protograph-Based Globally-Coupled LDPC Codes over the Gaussian Channel With Burst Erasures publication-title: IEEE Access doi: 10.1109/ACCESS.2019.2948970 contributor: fullname: Ji – volume: 68 start-page: 213 year: 2021 ident: ref_1 article-title: Quantum LDPC codes with almost linear minimum distance publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2021.3119384 contributor: fullname: Panteleev – volume: 65 start-page: 2062 year: 2019 ident: ref_19 article-title: From Cages to Trapping Sets and Codewords: A Technique to Derive Tight upper Bounds on the Minimum Size of Trapping Sets and Minimum Distance of LDPC Codes publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2018.2879823 contributor: fullname: Ali – volume: E105-B start-page: 894 year: 2022 ident: ref_4 article-title: LDPC Codes for Communication Systems: Coding Theoretic Perspective publication-title: IEICE Trans. Commun. doi: 10.1587/transcom.2021EBI0001 contributor: fullname: Takayuki – volume: 58 start-page: 2265 year: 2012 ident: ref_32 article-title: Searching for Voltage Graph-Based LDPC Tailbiting Codes with Large Girth publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2011.2176717 contributor: fullname: Bocharova – ident: ref_6 – volume: 73 start-page: 637 year: 2020 ident: ref_7 article-title: A survey on channel coding techniques for 5G wireless networks publication-title: Telecommun. Syst. doi: 10.1007/s11235-019-00630-3 contributor: fullname: Arora – volume: 18 start-page: 2418 year: 2018 ident: ref_9 article-title: Design and Analysis of Non-Binary LDPC-CPM System for Hybrid Check Matrix Construction Algorithm of WSN publication-title: Sensors doi: 10.3390/s18082418 contributor: fullname: Meng – ident: ref_8 doi: 10.3390/s21062012 – ident: ref_25 – volume: 18 start-page: 656 year: 2014 ident: ref_17 article-title: Deterministic girth-eight QC-LDPC codes with large column weight publication-title: IEEE Commun. Lett. doi: 10.1109/LCOMM.2014.030114.132853 contributor: fullname: Jian – volume: 65 start-page: 4023 year: 2019 ident: ref_2 article-title: Capacity-achieving guessing random additive noise decoding publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2019.2896110 contributor: fullname: Duffy – ident: ref_27 – volume: 67 start-page: 8206 year: 2019 ident: ref_30 article-title: Tail-Biting Globally-Coupled LDPC Codes publication-title: IEEE Trans. Commun. doi: 10.1109/TCOMM.2019.2944621 contributor: fullname: Ji – volume: 21 start-page: 2309 year: 2019 ident: ref_5 article-title: Survey of turbo, LDPC and polar decoder ASIC implementations publication-title: IEEE Commun. Surv. Tutor. doi: 10.1109/COMST.2019.2893851 contributor: fullname: Shao – volume: 65 start-page: 14 year: 2017 ident: ref_14 article-title: Symmetrical Constructions for Regular Girth-8 QC-LDPC Codes publication-title: IEEE Trans. Commun. contributor: fullname: Alireza – volume: 66 start-page: 1219 year: 2019 ident: ref_31 article-title: A (21150, 19050) GC-LDPC Decoder for NAND Flash Applications publication-title: IEEE Trans. Circuits Syst. I Regul. Pap. doi: 10.1109/TCSI.2018.2875311 contributor: fullname: Yen – ident: ref_13 – volume: 67 start-page: 5454 year: 2020 ident: ref_10 article-title: Flexible High Throughput QC-LDPC Decoder With Perfect Pipeline Conflicts Resolution and Efficient Hardware Utilization publication-title: IEEE Trans. Circuits Syst. I Regul. Pap. doi: 10.1109/TCSI.2020.3018048 contributor: fullname: Vladimir – volume: 24 start-page: 741 year: 2017 ident: ref_23 article-title: Explicit APM-LDPC codes with girths 6, 8, and 10 publication-title: IEEE Signal Process Lett. doi: 10.1109/LSP.2017.2688410 contributor: fullname: Mohammad – volume: 17 start-page: 369 year: 2013 ident: ref_16 article-title: Construction of girth-eight QC-LDPC codes from greatest common divisor publication-title: IEEE Commun. Lett. doi: 10.1109/LCOMM.2012.122012.122292 contributor: fullname: Guo |
SSID | ssj0023338 |
Score | 2.4308448 |
Snippet | By connecting multiple short, local low-density parity-check (LDPC) codes with a global parity check, the globally coupled (GC) LDPC code can attain high... |
SourceID | doaj pubmedcentral proquest gale crossref |
SourceType | Open Website Open Access Repository Aggregation Database |
StartPage | 7335 |
SubjectTerms | Algorithms Codes Construction Critical path Error correcting codes full-length row multiplier matrix globally coupled LDPC greatest common divisor large girth Low density parity check codes Lower bounds Parity Permutations |
SummonAdditionalLinks | – databaseName: DOAJ Directory of Open Access Journals dbid: DOA link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1NS_QwEB7Ekx7ET976RRTBU7FtkqY9uquryCry8griJeSr6qUr7Ar-fGfa7rrre_DitSklmclk5mmS5wE4kY5ky_IqdoqbWIgsjS3mXcQ8SSVVwAzpGrbPu_z6Qdw8ysc5qS86E9bSA7eGOxPGSWMs0dh54ga3aWVcgaBB8dLgjGtW31ROwVQHtTgir5ZHiCOoPxtnGJiKN5puX9mnIen_fyn-fjxyLt8M1mGtKxTZedvBDVgK9SasztEHbsETqW22_K_1M7tCmP_CLglss6t-PLy477P-yIcx62Gm8mxUMyz2sOmCDYZ_b9ktkfN_MPoRywzDxY4NSTGN9UhoaRseBpf_-tdxp5UQO1HISZwFLAyccDwUFQ4VzRSEtUGK3FMNkXoRZF466dNgfVn4xJHstFVS2SKpysB3YLke1eEPsBw_YovUlCq1WEw5G5TJRZE4nxtV-TSC46kN9VtLiaERSpCh9czQEfTIurMXiMW6eYC-1Z1v9U--jeCUfKMp1tATznRXBrCfxFqlzxWxwyHi5BHsT92nuyAc60xlghMnXRLB0awZw4f2REwdRu_NO1jDEqtqBGrB7QtdX2ypX18aIu5SKkSTfPc3xroHKxndrKANL7UPyzh7wgHWOxN72EztT1bP-9E priority: 102 providerName: Directory of Open Access Journals – databaseName: ProQuest Technology Collection dbid: 8FG link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV1Jb9NAFH6i5UIPiK2qaUFDhcTJqscz47FPqEmbRCipEKJSxWU0m5Ne7EBaiZ_Pe46TNiBx9Vhe5s1bvlm-D-Cj8iRbVtSp18KmUuY8dZh3EfNktdIRM6Tv2D6vism1_HKjbvoJt1W_rXITE7tAHVpPc-Rnuc6lIIKx7PPyZ0qqUbS62kto7MFTTkx4dFJ8NN4CLoH4a80mJBDan61ydE8tOmW3hxzUUfX_G5D_3iT5KOuMXsDzvlxk52v7voQnsXkFB49IBF_DD9LcXLPANnM2RrC_YJcEudl4mE4vvg7ZsA1xxQaYrwJrG4YlHzZdsNH024zNiKL_N6PpWGYZhjw2Jd00NiC5pTdwPbr8PpykvWJC6mWp7tI8YnngpRexrPFXM8ejdC4qWQSqJHiQURWVV4FHF6oyZJ7Ep51W2pVZXUVxCPtN28QjYAU-xJXcVpo7LKm8i9oWssx8KKyuA0_gdNOHZrkmxjAIKKijzbajExhQ725vIC7r7kL7a2561zDSemWtI6LCQOzvjtfWlwgLtagsxpQEPpFtDHkcWsLb_uAAfidxV5lzTRxxiDtFAicb85neFVfmYeAk8GHbjE5EKyO2ie19dw9WssStmoDeMfvOp--2NLeLjo67UhoxpXj7_5cfw7OcTk7QgpY-gX0cF_Ed1jN37n03aP8AAA3zrg priority: 102 providerName: ProQuest – databaseName: Scholars Portal Open Access Journals dbid: M48 link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1NT9wwEB1RemkPFR-tmpZWpkLqKSWJ7Tg5VBW7sCC0i6qqK6FeLH8FkKqkZUGCf89MNrsiwJFrbEX2zNgzL47fA9iRjmTL8ip2iptYiCyNLeZdxDxJJVXADOlats-T_Ggqjk_l6QosNDY7A86ehHakJzW9_Pvt5v_tD1zw3wlxImTfnWW47BTn8gW8zAQXFOgTsTxMyDjCsDmpUL97LxW1jP2P9-WH_0reSz6jNXjTVY1sb-7mdVgJ9Qa8vscluAl_SHpzTgZbn7FDxPzn7ICQNzscxuP9n0M2bHyYsQGmLc-ammHlh037bDT-NWETYuq_YfRVlhmGOx8bk3waG5Dq0luYjg5-D4_iTjghdqKQV3EWsEpwwvFQVDjVxKZBWBukyD0VFKkXQealkz4N1peFTxxpUFsllS2Sqgz8HazWTR3eA8vxJbZITalSi5WVs0GZXBSJ87lRlU8j-LKwof4358fQiCvI0Hpp6AgGZN1lB6K0bh80l2e6WyFaGCeNscRX6IkE3qaVcQWiQ8VLg1tLBF_JN5pCAT3hTHd_AMdJFFZ6TxFVHMJPHsHWwn16EVA6UxgaRFCXRLC9bMa1RAckpg7NddsHC1qiWI1A9dzeG3q_pb44b1m5S6kQWvIPzzHXj_Aqo2sWdPqltmAVoyd8wuLnyn5uQ_sOuhcCEQ priority: 102 providerName: Scholars Portal |
Title | Constructing Grith Eight GC-LDPC Codes Based on the GCD FLRM Matrix with a New Lower Bound |
URI | https://www.proquest.com/docview/2724301360 https://search.proquest.com/docview/2725190098 https://pubmed.ncbi.nlm.nih.gov/PMC9571483 https://doaj.org/article/4ac5aab4404d4610b1fac8249739a042 |
Volume | 22 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3fT9swED4Be9kepsE2LRtUZpq0p9AktuPkkYa2aGpRhYZU7SXyrwASJGgFiT9_d2lS0e1tL36IncjxnX332efvAL5JS2nL0iq0iutQiCQODdpdxDxRJZVHC2lbts-L9PxK_FjK5Q7I_i5MG7Rvze1JfXd_Ut_etLGVD_d22MeJDRfzIpcKvXg-3IVdxXkP0TuUxRF0rSmEOOL54SrBOYmtKEUNLtYcLTDfskEtVf-_C_LfQZIvrM7kHbzt3EV2uu7WPuz4-gDevCARfA-_KOfmmgW2vmZTBPs3bEyQm02LcHa2KFjROL9iI7RXjjU1Q5cPq87YZHY5Z3Oi6H9mtB3LNMMlj80obxobUbqlD3A1Gf8szsMuY0JoRSYfw8Sje2CF5T6r8K8jE3thjJcideRJxE54meZWutgbl2cuspR82iipTBZVuecfYa9uav8JWIofMVmscxUbdKms8UqnIousS7WqXBzA134My4c1MUaJgILGvNyMeQAjGt1NA-Kybh80v6_LTqKl0FZqbYio0BH7u4krbTOEhYrnGteUAL6TbEqacSgJq7uLA9hP4q4qTxVxxCHu5AEc9uIru6m4KhOVCE7MdFEAx5tqnER0MqJr3zy1bdCTJW7VANSW2Le6vl2D2tnScXfa-Pm_3_wCrxO6VEFnXeoQ9lBl_BG6Oo9mgAq-VFhmk-kAXo3GF4vLQbttgOVcZINW9f8AT7gCDQ |
link.rule.ids | 230,315,733,786,790,870,891,2115,2236,12083,12792,21416,24346,27955,27956,31752,31753,33406,33407,33777,33778,43343,43633,43838,53825,53827,74100,74390,74657 |
linkProvider | National Library of Medicine |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV1bb9MwFD6C7gF4QFxFtgEGIfEULYntOHma1q5dgbSapk2aeLF8y8ZLMtZN4ufvnDTtVpB4ja3E8fG5fHbyfQBfpCPZsryOneImFiJLY4t5FzFPUksVMEO6ju1znk_PxPdzed5vuC36zypXMbEL1L51tEe-l6lMcCIYS_avfsekGkWnq72ExmPYIsrNYgBbw_H8-GQNuTgisCWfEEdwv7fI0EEV77Td7rNQR9b_b0j--zPJB3ln8gKe9wUjO1ha-CU8Cs0rePaARvA1_CTVzSUPbHPBjhDuX7IxgW52NIqrw-MRG7U-LNgQM5ZnbcOw6MOmQzapTmZsRiT9fxhtyDLDMOixipTT2JAEl97A2WR8OprGvWZC7EQhb-IsYIHghOOhqPFVE5sGYW2QIvdUS6ReBJmXTvo0WF8WPnEkP22VVLZI6jLwtzBo2ia8A5bjTWyRmlKlFosqZ4MyuSgS53Ojap9G8Hk1h_pqSY2hEVLQROv1REcwpNlddyA26-5Ce32he-fQwjhpjCWqQk_87zatjSsQGCpeGowqEXwl22jyObSEM_2vAzhOYq_SB4pY4hB58gh2V-bTvTMu9P3SieDTuhndiM5GTBPa264P1rLErhqB2jD7xtA3W5pflx0hdykVokq-_f-Hf4Qn09NZpatv8x878DSj_yjoeEvtwgDXSHiP1c2N_dAv4TvFgfgF |
linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV1bb9MwFD6CISF4QFy1jAEGIfEUNYntOHlCa7tuQDdNiEkVL5Zv2XhJNjqk_fydk7rtyqS9xlbi-Phcvtj5PoDP0pFsWdmkTnGTClHkqcW8i5gna6QKmCFdz_Z5XB6eiu8zOYvnn-bxWOUyJvaB2neOvpEPClUITgRj2aCJxyJOxpOvF5cpKUjRTmuU03gIjzBLZiTjoGZr8MURiy2YhTjC_MG8QFdVvFd5W-ejnrb_bnD-_8DkrQw0eQ7PYunI9ha2fgEPQvsSnt4iFHwFv0l_c8EI256xAwT-52yf4Dc7GKXT8cmIjTof5myIucuzrmVY_mHTmE2mP4_YEdH1XzP6NMsMw_DHpqShxoYkvfQaTif7v0aHaVRPSJ2o5FVaBCwVnHA8VA2-ambzIKwNUpSeqorciyDL2kmfB-vrymeOhKitkspWWVMH_ga22q4N28BKvImtclOr3GJ55WxQphRV5nxpVOPzBD4t51BfLEgyNIILmmi9mugEhjS7qw7Ea91f6P6e6egmWhgnjbFEWuiJCd7mjXEVQkTFa4PxJYEvZBtN3oeWcCb-RIDjJB4rvaeILw4xKE9gd2k-Hd1yrteLKIGPq2Z0KNolMW3o_vV9sKolntUE1IbZN4a-2dL-Oe-puWupEF_ynfsf_gEe49rV02_HP97Ck4J-qKB9LrULW7hEwjssc67s-3793gD2vvrC |
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=Constructing+Grith+Eight+GC-LDPC+Codes+Based+on+the+GCD+FLRM+Matrix+with+a+New+Lower+Bound&rft.jtitle=Sensors+%28Basel%2C+Switzerland%29&rft.au=Kun+Zhu&rft.au=Hongwen+Yang&rft.date=2022-09-27&rft.pub=MDPI+AG&rft.eissn=1424-8220&rft.volume=22&rft.issue=19&rft.spage=7335&rft_id=info:doi/10.3390%2Fs22197335&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_4ac5aab4404d4610b1fac8249739a042 |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1424-8220&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1424-8220&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1424-8220&client=summon |