A Random Local Matroid Search Algorithm to Construct Good Rate 1/p Systematic Binary Quasi-Cyclic Codes
In this letter, a random local matroid search algorithm is proposed to construct good rate 1/p systematic QC codes based on the relationship between the generator matrix and the minimum distance when the length of the information vector is k ≥ 15 . More than twenty new QC codes are obtained and thei...
Saved in:
| Published in | IEEE communications letters Vol. 19; no. 5; pp. 699 - 702 |
|---|---|
| Main Authors | , , , |
| Format | Journal Article |
| Language | English |
| Published |
IEEE
01.05.2015
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 1089-7798 |
| DOI | 10.1109/LCOMM.2015.2401572 |
Cover
| Abstract | In this letter, a random local matroid search algorithm is proposed to construct good rate 1/p systematic QC codes based on the relationship between the generator matrix and the minimum distance when the length of the information vector is k ≥ 15 . More than twenty new QC codes are obtained and their corresponding generator matrices are revealed, which extends previous results. Nine of these new codes have larger minimum distances than the reported ones in the previous literature. |
|---|---|
| AbstractList | In this letter, a random local matroid search algorithm is proposed to construct good rate $1/p$ systematic QC codes based on the relationship between the generator matrix and the minimum distance when the length of the information vector is $k\geq 15$. More than twenty new QC codes are obtained and their corresponding generator matrices are revealed, which extends previous results. Nine of these new codes have larger minimum distances than the reported ones in the previous literature. In this letter, a random local matroid search algorithm is proposed to construct good rate 1/p systematic QC codes based on the relationship between the generator matrix and the minimum distance when the length of the information vector is k ≥ 15 . More than twenty new QC codes are obtained and their corresponding generator matrices are revealed, which extends previous results. Nine of these new codes have larger minimum distances than the reported ones in the previous literature. |
| Author | Shuiping Zhang Jiguang He Guangfu Wu Yong Li |
| Author_xml | – sequence: 1 givenname: Guangfu surname: Wu fullname: Wu, Guangfu – sequence: 2 givenname: Yong surname: Li fullname: Li, Yong – sequence: 3 givenname: Shuiping surname: Zhang fullname: Zhang, Shuiping – sequence: 4 givenname: Jiguang surname: He fullname: He, Jiguang |
| BookMark | eNo9kEFPwjAUx3vAREC_gF569DJot7Vdj7gomowQhXtTugfUbCu23YFv7xDj5b3k5f97-ec3QaPOdYDQAyUzSomcV-V6tZqlhLJZmg9TpCM0pqSQiRCyuEWTEL4IIUXK6BgdFvhTd7VrceWMbvBKR-9sjTegvTniRXNw3sZji6PDpetC9L2JeOlcPXARMJ2f8OYcIrQ6WoOfbaf9GX_0OtikPJtmuJWuhnCHbva6CXD_t6do-_qyLd-Sar18LxdVYoY6MTH7nOWM1VpwVhAQmdkBaEMA9oZRwTPDtNCp5CLNdpATI6XY1ZxxXuRayGyKnq5vT9599xCiam0w0DS6A9cHRQWRghFOxRBNr1HjXQge9urkbTu0V5Soi0j1K1JdRKo_kQP0eIUsAPwDgmScSJb9AMsvcqg |
| CODEN | ICLEF6 |
| Cites_doi | 10.1109/18.79911 10.1049/iet-com.2013.0671 10.1109/TIT.1967.1053974 10.2307/1993185 10.1109/TIT.2007.896862 10.1109/TIT.1973.1054975 10.1007/s10623-012-9715-1 10.1002/j.1538-7305.1948.tb01338.x 10.1109/18.333888 10.1109/18.705580 10.2307/2371182 10.1016/0893-9659(95)00071-W 10.1109/TIT.2008.924700 |
| ContentType | Journal Article |
| DBID | 97E RIA RIE AAYXX CITATION 7SC 7SP 8FD F28 FR3 JQ2 L7M L~C L~D |
| DOI | 10.1109/LCOMM.2015.2401572 |
| DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Technology Research Database ANTE: Abstracts in New Technology & Engineering Engineering Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Engineering Research Database Advanced Technologies Database with Aerospace ANTE: Abstracts in New Technology & Engineering Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Technology Research Database |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EndPage | 702 |
| ExternalDocumentID | 10_1109_LCOMM_2015_2401572 7036095 |
| Genre | orig-research |
| GrantInformation_xml | – fundername: National Natural Science Foundation of China grantid: 11461031; 61462034 ; 61401050 funderid: 10.13039/501100001809 – fundername: Science and Technology Project of Chongqing Municipal Education Commission grantid: KJ1400425 |
| GroupedDBID | -~X 0R~ 29I 4.4 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABQJQ ABVLG ACGFO ACIWK AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ATWAV AZLTO BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 EBS EJD HZ~ H~9 IES IFIPE IFJZH IPLJI JAVBF LAI M43 O9- OCL P2P RIA RIE RNS TN5 VH1 AAYXX CITATION 7SC 7SP 8FD F28 FR3 JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c251t-cf45455da76580e73cbeeac0eefc51763c5a7a296723be40c997bd656684a793 |
| IEDL.DBID | RIE |
| ISSN | 1089-7798 |
| IngestDate | Sun Sep 28 08:51:27 EDT 2025 Wed Oct 01 04:52:54 EDT 2025 Wed Aug 27 02:48:16 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 5 |
| Keywords | random local matroid search algorithm matroid theory minimum distance Binary quasi-cyclic codes |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c251t-cf45455da76580e73cbeeac0eefc51763c5a7a296723be40c997bd656684a793 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| PQID | 1709750617 |
| PQPubID | 23500 |
| PageCount | 4 |
| ParticipantIDs | proquest_miscellaneous_1709750617 crossref_primary_10_1109_LCOMM_2015_2401572 ieee_primary_7036095 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2015-May 2015-5-00 20150501 |
| PublicationDateYYYYMMDD | 2015-05-01 |
| PublicationDate_xml | – month: 05 year: 2015 text: 2015-May |
| PublicationDecade | 2010 |
| PublicationTitle | IEEE communications letters |
| PublicationTitleAbbrev | COML |
| PublicationYear | 2015 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| References | ref13 ref12 weldon (ref2) 1970; 13 ref14 ref11 ref10 chen (ref4) 2011 ref1 oxley (ref15) 1992 ref17 ref8 ref7 ref9 ref3 ref6 grassl (ref16) 0 ref5 |
| References_xml | – year: 0 ident: ref16 publication-title: Tables of linear codes and quantum codes – ident: ref5 doi: 10.1109/18.79911 – ident: ref13 doi: 10.1049/iet-com.2013.0671 – ident: ref3 doi: 10.1109/TIT.1967.1053974 – ident: ref10 doi: 10.2307/1993185 – ident: ref12 doi: 10.1109/TIT.2007.896862 – year: 1992 ident: ref15 publication-title: Matroid Theory – ident: ref17 doi: 10.1109/TIT.1973.1054975 – ident: ref14 doi: 10.1007/s10623-012-9715-1 – year: 2011 ident: ref4 – ident: ref1 doi: 10.1002/j.1538-7305.1948.tb01338.x – ident: ref7 doi: 10.1109/18.333888 – ident: ref8 doi: 10.1109/18.705580 – ident: ref9 doi: 10.2307/2371182 – volume: 13 start-page: 130 year: 1970 ident: ref2 article-title: Long quasi-cyclic codes are good publication-title: IEEE Trans Inf Theory – ident: ref6 doi: 10.1016/0893-9659(95)00071-W – ident: ref11 doi: 10.1109/TIT.2008.924700 |
| SSID | ssj0008251 |
| Score | 2.1203995 |
| Snippet | In this letter, a random local matroid search algorithm is proposed to construct good rate 1/p systematic QC codes based on the relationship between the... In this letter, a random local matroid search algorithm is proposed to construct good rate $1/p$ systematic QC codes based on the relationship between the... |
| SourceID | proquest crossref ieee |
| SourceType | Aggregation Database Index Database Publisher |
| StartPage | 699 |
| SubjectTerms | Binary quasi-cyclic codes Binary systems Construction Generators Linear codes Mathematical analysis Matroid theory Minimum distance Quality control Random local matroid search algorithm Search algorithms Systematics Vectors Vectors (mathematics) Welding |
| Title | A Random Local Matroid Search Algorithm to Construct Good Rate 1/p Systematic Binary Quasi-Cyclic Codes |
| URI | https://ieeexplore.ieee.org/document/7036095 https://www.proquest.com/docview/1709750617 |
| Volume | 19 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) issn: 1089-7798 databaseCode: RIE dateStart: 19970101 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://ieeexplore.ieee.org/ omitProxy: false ssIdentifier: ssj0008251 providerName: IEEE |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1Lj9MwEB51e4ID7FIQhV1kJG6Q1nk4To7dilKhBgQUqbcofnUr2rii6YH99Tt22ooFDtyiKHas-eyZz-OZMcCbNKZGRcYELFURblBSEwiBgDCX9xlloaTKuQaKT-n0e_JxwRYdeHfKhdFa--AzPXCP_ixfWbl3rrKhKxaFlOAMzniWtrlaJ63rUjDbYPocGWOeHRNkaD6cjT8XhYviYgO0XyHj0T0j5G9V-UsVe_syeQzFcWRtWMmPwb4RA3n7R9HG_x36OTw6EE0yamfGBXR0_QQe_lZ-sAfLEfla1cpuyMxZNFI4v_hKkTYEmYzWS_tz1dxsSGOJu9jTl5olH6xV2K7RJBxuybdTJWhy7VN7yZd9tVsF419yje_GVundU5hP3s_H0-Bw8UIgUYpNIE2CxIqpiiM_oZrHUmhU0FRrI1mIGkmyildRnvIoFjqhMs-5UI4ZZkmFC_4ZdGtb6-dAsiQRaWS4UiJKREIrEzNDmUg1dpvFpg9vj0CU27a8Rum3JTQvPWylg608wNaHnpPs6cuDUPvw-ohdiYvDnXhUtbb7XRlymiMlQpb24t9NX8ID94M2gvESuihIfYUsoxGv_PS6A-MizdQ |
| linkProvider | IEEE |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LT9wwEB4BPQCH0kIR2xeuxK1k10nsPI7LqnRpNyDKInGL4hesgBix2UP76zt2dle09NBbFMWONZ8983k8MwY4SGJqVGRMwBMV4QYlMYEQCAh3eZ9RFkqqnGugOE2Gl-zbFb9agcNlLozW2gef6a579Gf5ysqZc5X1XLEopASr8IIzxnibrbXUuy4Jsw2nz5Ez5tkiRYbmvdHgrChcHBfvogULeRr9YYb8vSrPlLG3MMdbUCzG1gaW3HZnjejKX3-Vbfzfwb-Cl3OqSfrt3HgNK7rehs0nBQh34LpPflS1svdk5GwaKZxnfKJIG4RM-nfX9nHS3NyTxhJ3tacvNku-WquwXaNJ2HsgF8ta0OTIJ_eS81k1nQSDn_IO3w2s0tM3MD7-Mh4Mg_nVC4FEKTaBNAypFVdVigyF6jSWQqOKplobyUPUSZJXaRXlSRrFQjMq8zwVynHDjFW45Hdhrba13gOSMSaSyKRKiYgJRisTc0O5SDR2m8WmA58XQJQPbYGN0m9MaF562EoHWzmHrQM7TrLLL-dC7cCnBXYlLg935lHV2s6mZZjSHEkR8rS3_266D-vDcTEqRyen39_BhvtZG8_4HtZQqPoDco5GfPRT7TfVR9Eh |
| 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+Random+Local+Matroid+Search+Algorithm+to+Construct+Good+Rate+%241%2Fp%24+Systematic+Binary+Quasi-Cyclic+Codes&rft.jtitle=IEEE+communications+letters&rft.au=Wu%2C+Guangfu&rft.au=Li%2C+Yong&rft.au=Zhang%2C+Shuiping&rft.au=He%2C+Jiguang&rft.date=2015-05-01&rft.issn=1089-7798&rft.volume=19&rft.issue=5&rft.spage=699&rft.epage=702&rft_id=info:doi/10.1109%2FLCOMM.2015.2401572&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1089-7798&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1089-7798&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1089-7798&client=summon |