{"id":"https://openalex.org/W2013894751","doi":"https://doi.org/10.1109/vtcfall.2012.6399027","title":"Low Complexity Progressive Edge-Growth Algorithm Based on Chinese Remainder Theorem","display_name":"Low Complexity Progressive Edge-Growth Algorithm Based on Chinese Remainder Theorem","publication_year":2012,"publication_date":"2012-09-01","ids":{"openalex":"https://openalex.org/W2013894751","doi":"https://doi.org/10.1109/vtcfall.2012.6399027","mag":"2013894751"},"language":"en","primary_location":{"id":"doi:10.1109/vtcfall.2012.6399027","is_oa":false,"landing_page_url":"https://doi.org/10.1109/vtcfall.2012.6399027","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Vehicular Technology Conference (VTC Fall)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5061105504","display_name":"Xueqin Jiang","orcid":"https://orcid.org/0000-0002-0414-4349"},"institutions":[{"id":"https://openalex.org/I181326427","display_name":"Donghua University","ror":"https://ror.org/035psfh38","country_code":"CN","type":"education","lineage":["https://openalex.org/I181326427"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xueqin Jiang","raw_affiliation_strings":["Donghua University, Shanghai, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Donghua University, Shanghai, China","institution_ids":["https://openalex.org/I181326427"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082500156","display_name":"Papa Ousmance Thiaw Diagne","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Papa Ousmance Thiaw Diagne","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113661810","display_name":"Moon Ho Lee","orcid":null},"institutions":[{"id":"https://openalex.org/I80611190","display_name":"Jeonbuk National University","ror":"https://ror.org/05q92br09","country_code":"KR","type":"education","lineage":["https://openalex.org/I80611190"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Moon Ho Lee","raw_affiliation_strings":["Jeonbuk National University, Jeonju, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Jeonbuk National University, Jeonju, South Korea","institution_ids":["https://openalex.org/I80611190"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030510557","display_name":"Wujun Xu","orcid":"https://orcid.org/0000-0002-3177-4709"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wujun Xu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5659,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.58332077,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"57","issue":null,"first_page":"1","last_page":"5"},"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.9919999837875366,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9876000285148621,"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.8244925737380981},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.6334184408187866},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5764462947845459},{"id":"https://openalex.org/keywords/parity-check-matrix","display_name":"Parity-check matrix","score":0.5388334393501282},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5243219137191772},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5137249231338501},{"id":"https://openalex.org/keywords/chinese-remainder-theorem","display_name":"Chinese remainder theorem","score":0.457946240901947},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.45263564586639404},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.42468762397766113},{"id":"https://openalex.org/keywords/girth","display_name":"Girth (graph theory)","score":0.41893044114112854},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3823031485080719},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34041476249694824},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.28095459938049316},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07962304353713989}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8244925737380981},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.6334184408187866},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5764462947845459},{"id":"https://openalex.org/C95925971","wikidata":"https://www.wikidata.org/wiki/Q3100414","display_name":"Parity-check matrix","level":4,"score":0.5388334393501282},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5243219137191772},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5137249231338501},{"id":"https://openalex.org/C151635116","wikidata":"https://www.wikidata.org/wiki/Q193878","display_name":"Chinese remainder theorem","level":2,"score":0.457946240901947},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.45263564586639404},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.42468762397766113},{"id":"https://openalex.org/C2777434295","wikidata":"https://www.wikidata.org/wiki/Q959831","display_name":"Girth (graph theory)","level":2,"score":0.41893044114112854},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3823031485080719},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34041476249694824},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.28095459938049316},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07962304353713989},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/vtcfall.2012.6399027","is_oa":false,"landing_page_url":"https://doi.org/10.1109/vtcfall.2012.6399027","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Vehicular Technology Conference (VTC Fall)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W2024099163","https://openalex.org/W2058275835","https://openalex.org/W2097728655","https://openalex.org/W2103353540","https://openalex.org/W2119366407","https://openalex.org/W2126259959","https://openalex.org/W2127490352","https://openalex.org/W2128765501","https://openalex.org/W2152185946","https://openalex.org/W2156938362","https://openalex.org/W4256648168","https://openalex.org/W6674593346"],"related_works":["https://openalex.org/W2537963609","https://openalex.org/W2005341112","https://openalex.org/W2370232613","https://openalex.org/W2143011401","https://openalex.org/W2148630017","https://openalex.org/W2092857423","https://openalex.org/W2775568945","https://openalex.org/W2150639697","https://openalex.org/W2163532780","https://openalex.org/W2386033600"],"abstract_inverted_index":{"Progressive":[0],"edge-growth":[1],"(PEG)":[2],"algorithm":[3,48,85,154],"construction":[4,138,147],"builds":[5],"the":[6,17,21,30,42,46,55,63,83,104,105,113,122,131,136,140,144,152],"Tanner":[7],"graph":[8],"for":[9],"an":[10,25,93,117],"LDPC":[11,78,90,94,118],"code":[12,79,91,95,114,119,132,146,168],"by":[13,73,159],"establishing":[14],"edges":[15],"between":[16],"symbol":[18,58],"nodes":[19,23,59],"and":[20,28,60,86,169],"check":[22,66],"in":[24,33,135,173],"edge-by-edge":[26],"manner":[27],"maximizing":[29],"local":[31],"girth":[32],"a":[34,76,156,161,166],"greedy":[35],"fashion.":[36],"This":[37,110],"approach":[38],"is":[39,54,62,149],"simple":[40],"but":[41],"computational":[43,141],"complexity":[44,142],"of":[45,57,65,80,96,116,143,165],"PEG":[47,84,123,137],"scale":[49],"as":[50],"O(nm),":[51],"where":[52,99],"n":[53,100],"number":[56,64],"m":[61],"nodes.":[67],"We":[68],"deal":[69],"with":[70,121],"this":[71,89],"problem":[72],"first":[74],"construct":[75],"base":[77,167],"length":[81,97,115,133],"n1with":[82],"then":[87],"extend":[88],"into":[92],"n,":[98],"\u2265":[101],"n1,":[102],"via":[103],"chinese":[106],"remainder":[107],"theorem":[108],"(CRT).":[109],"method":[111],"increase":[112],"generated":[120],"algorithm,":[124],"without":[125],"decreasing":[126],"its":[127],"girth.":[128],"Due":[129],"to":[130],"reducing":[134],"step,":[139],"whole":[145],"process":[148],"reduced.":[150],"Furthermore,":[151],"proposed":[153],"have":[155],"potential":[157],"advantage":[158],"storing":[160],"small":[162],"parity-check":[163],"matrix":[164],"extending":[170],"it":[171],"\u201con-the-fly\u201d":[172],"hardware.":[174]},"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}