{"id":"https://openalex.org/W2518490553","doi":"https://doi.org/10.3390/e18080305","title":"An Efficient Method to Construct Parity-Check Matrices for Recursively Encoding Spatially Coupled LDPC Codes \u2020","display_name":"An Efficient Method to Construct Parity-Check Matrices for Recursively Encoding Spatially Coupled LDPC Codes \u2020","publication_year":2016,"publication_date":"2016-08-17","ids":{"openalex":"https://openalex.org/W2518490553","doi":"https://doi.org/10.3390/e18080305","mag":"2518490553"},"language":"en","primary_location":{"id":"doi:10.3390/e18080305","is_oa":true,"landing_page_url":"https://doi.org/10.3390/e18080305","pdf_url":"https://www.mdpi.com/1099-4300/18/8/305/pdf?version=1471421149","source":{"id":"https://openalex.org/S195231649","display_name":"Entropy","issn_l":"1099-4300","issn":["1099-4300"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Entropy","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1099-4300/18/8/305/pdf?version=1471421149","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5001455682","display_name":"Zhongwei Si","orcid":"https://orcid.org/0000-0002-8286-2872"},"institutions":[{"id":"https://openalex.org/I139759216","display_name":"Beijing University of Posts and Telecommunications","ror":"https://ror.org/04w9fbh59","country_code":"CN","type":"education","lineage":["https://openalex.org/I139759216"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Zhongwei Si","raw_affiliation_strings":["Key Laboratory of Universal Wireless Communications, Ministry of Education, Beijing University of Posts and Telecommunications (BUPT), No. 10 Xitucheng Road, Haidian District, Beijing 100876, China"],"affiliations":[{"raw_affiliation_string":"Key Laboratory of Universal Wireless Communications, Ministry of Education, Beijing University of Posts and Telecommunications (BUPT), No. 10 Xitucheng Road, Haidian District, Beijing 100876, China","institution_ids":["https://openalex.org/I139759216"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100712619","display_name":"Sijie Wang","orcid":"https://orcid.org/0000-0002-2912-0773"},"institutions":[{"id":"https://openalex.org/I139759216","display_name":"Beijing University of Posts and Telecommunications","ror":"https://ror.org/04w9fbh59","country_code":"CN","type":"education","lineage":["https://openalex.org/I139759216"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Sijie Wang","raw_affiliation_strings":["Key Laboratory of Universal Wireless Communications, Ministry of Education, Beijing University of Posts and Telecommunications (BUPT), No. 10 Xitucheng Road, Haidian District, Beijing 100876, China"],"affiliations":[{"raw_affiliation_string":"Key Laboratory of Universal Wireless Communications, Ministry of Education, Beijing University of Posts and Telecommunications (BUPT), No. 10 Xitucheng Road, Haidian District, Beijing 100876, China","institution_ids":["https://openalex.org/I139759216"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078149073","display_name":"Junyang Ma","orcid":null},"institutions":[{"id":"https://openalex.org/I139759216","display_name":"Beijing University of Posts and Telecommunications","ror":"https://ror.org/04w9fbh59","country_code":"CN","type":"education","lineage":["https://openalex.org/I139759216"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Junyang Ma","raw_affiliation_strings":["Key Laboratory of Universal Wireless Communications, Ministry of Education, Beijing University of Posts and Telecommunications (BUPT), No. 10 Xitucheng Road, Haidian District, Beijing 100876, China"],"affiliations":[{"raw_affiliation_string":"Key Laboratory of Universal Wireless Communications, Ministry of Education, Beijing University of Posts and Telecommunications (BUPT), No. 10 Xitucheng Road, Haidian District, Beijing 100876, China","institution_ids":["https://openalex.org/I139759216"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5001455682"],"corresponding_institution_ids":["https://openalex.org/I139759216"],"apc_list":{"value":2000,"currency":"CHF","value_usd":2165},"apc_paid":{"value":2000,"currency":"CHF","value_usd":2165},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10588916,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"18","issue":"8","first_page":"305","last_page":"305"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.8784867525100708},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6139720678329468},{"id":"https://openalex.org/keywords/belief-propagation","display_name":"Belief propagation","score":0.5956023335456848},{"id":"https://openalex.org/keywords/parity-check-matrix","display_name":"Parity-check matrix","score":0.5642422437667847},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5542704463005066},{"id":"https://openalex.org/keywords/parity-bit","display_name":"Parity bit","score":0.5524269938468933},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.47753965854644775},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.46568313241004944},{"id":"https://openalex.org/keywords/parity","display_name":"Parity (physics)","score":0.45485547184944153},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4280550181865692},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.41776666045188904},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4172933101654053},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37544792890548706}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8784867525100708},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6139720678329468},{"id":"https://openalex.org/C152948882","wikidata":"https://www.wikidata.org/wiki/Q4060686","display_name":"Belief propagation","level":3,"score":0.5956023335456848},{"id":"https://openalex.org/C95925971","wikidata":"https://www.wikidata.org/wiki/Q3100414","display_name":"Parity-check matrix","level":4,"score":0.5642422437667847},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5542704463005066},{"id":"https://openalex.org/C131521367","wikidata":"https://www.wikidata.org/wiki/Q625502","display_name":"Parity bit","level":2,"score":0.5524269938468933},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.47753965854644775},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.46568313241004944},{"id":"https://openalex.org/C2777151079","wikidata":"https://www.wikidata.org/wiki/Q141160","display_name":"Parity (physics)","level":2,"score":0.45485547184944153},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4280550181865692},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.41776666045188904},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4172933101654053},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37544792890548706},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C109214941","wikidata":"https://www.wikidata.org/wiki/Q18334","display_name":"Particle physics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/e18080305","is_oa":true,"landing_page_url":"https://doi.org/10.3390/e18080305","pdf_url":"https://www.mdpi.com/1099-4300/18/8/305/pdf?version=1471421149","source":{"id":"https://openalex.org/S195231649","display_name":"Entropy","issn_l":"1099-4300","issn":["1099-4300"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Entropy","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:df9a85df67184178987fd7722a02072a","is_oa":true,"landing_page_url":"https://doaj.org/article/df9a85df67184178987fd7722a02072a","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Entropy, Vol 18, Iss 8, p 305 (2016)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1099-4300/18/8/305/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/e18080305","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Entropy; Volume 18; Issue 8; Pages: 305","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/e18080305","is_oa":true,"landing_page_url":"https://doi.org/10.3390/e18080305","pdf_url":"https://www.mdpi.com/1099-4300/18/8/305/pdf?version=1471421149","source":{"id":"https://openalex.org/S195231649","display_name":"Entropy","issn_l":"1099-4300","issn":["1099-4300"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Entropy","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2518490553.pdf","grobid_xml":"https://content.openalex.org/works/W2518490553.grobid-xml"},"referenced_works_count":39,"referenced_works":["https://openalex.org/W1676391945","https://openalex.org/W1864365761","https://openalex.org/W1972036717","https://openalex.org/W1982045017","https://openalex.org/W1984762281","https://openalex.org/W1991528082","https://openalex.org/W2006317538","https://openalex.org/W2012638633","https://openalex.org/W2014681594","https://openalex.org/W2054309988","https://openalex.org/W2069122082","https://openalex.org/W2070715428","https://openalex.org/W2071304218","https://openalex.org/W2071878365","https://openalex.org/W2103960432","https://openalex.org/W2123119950","https://openalex.org/W2136923821","https://openalex.org/W2139012746","https://openalex.org/W2143439424","https://openalex.org/W2154935897","https://openalex.org/W2156973751","https://openalex.org/W2166330961","https://openalex.org/W2168300614","https://openalex.org/W2172679141","https://openalex.org/W2183167460","https://openalex.org/W2247119331","https://openalex.org/W2570804843","https://openalex.org/W2951478830","https://openalex.org/W2952440034","https://openalex.org/W2953031842","https://openalex.org/W2962770701","https://openalex.org/W2962944074","https://openalex.org/W2963658019","https://openalex.org/W3100523383","https://openalex.org/W3104291019","https://openalex.org/W3105422132","https://openalex.org/W3125530803","https://openalex.org/W4300188436","https://openalex.org/W6677734771"],"related_works":["https://openalex.org/W2011305240","https://openalex.org/W2885795561","https://openalex.org/W2537963609","https://openalex.org/W2336199159","https://openalex.org/W2572298685","https://openalex.org/W2092857423","https://openalex.org/W2141157615","https://openalex.org/W4384074457","https://openalex.org/W2083917443","https://openalex.org/W2596270314"],"abstract_inverted_index":{"Spatially":[0],"coupled":[1,53],"low-density":[2],"parity-check":[3,47,76],"(LDPC)":[4],"codes":[5,19,55],"have":[6],"attracted":[7],"considerable":[8],"attention":[9],"due":[10],"to":[11,45,79,131,148],"their":[12],"promising":[13],"performance.":[14],"Recursive":[15],"encoding":[16,51],"of":[17,75,83,115,134],"the":[18,30,73,80,84,97,101,105,132,142,153,165],"with":[20,33,56],"low":[21,24],"delay":[22],"and":[23,69,104,118],"complexity":[25],"has":[26,121],"been":[27,122],"proposed":[28,144],"in":[29,113,129],"literature":[31],"but":[32],"constraints":[34],"or":[35],"restrictions.":[36],"In":[37],"this":[38],"manuscript":[39],"we":[40],"propose":[41],"an":[42],"efficient":[43],"method":[44,145],"construct":[46],"matrices":[48],"for":[49,72],"recursively":[50],"spatially":[52],"LDPC":[54],"arbitrarily":[57],"chosen":[58],"node":[59],"degrees.":[60],"A":[61],"general":[62],"principle":[63],"is":[64,93],"proposed,":[65],"which":[66,163],"provides":[67],"feasible":[68],"practical":[70],"guidance":[71],"construction":[74],"matrices.":[77],"According":[78],"specific":[81],"structure":[82],"matrix,":[85],"each":[86],"parity":[87],"bit":[88],"at":[89,100,108],"a":[90],"coupling":[91],"position":[92,103],"jointly":[94],"determined":[95],"by":[96,141],"information":[98],"bits":[99,107],"current":[102],"encoded":[106],"former":[109],"positions.":[110],"Performance":[111],"analysis":[112],"terms":[114],"design":[116],"rate":[117],"density":[119],"evolution":[120],"presented.":[123],"It":[124],"can":[125],"be":[126],"observed":[127],"that,":[128],"addition":[130],"feature":[133],"recursive":[135],"encoding,":[136],"selected":[137],"code":[138],"structures":[139],"constructed":[140],"newly":[143],"may":[146],"lead":[147],"better":[149],"belief-propagation":[150],"thresholds":[151],"than":[152],"conventional":[154],"structures.":[155],"Finite-length":[156],"simulation":[157],"results":[158],"are":[159],"provided":[160],"as":[161],"well,":[162],"verify":[164],"theoretical":[166],"analysis.":[167]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}