{"id":"https://openalex.org/W2743300264","doi":"https://doi.org/10.1109/isit.2017.8006719","title":"A two-stage decoding algorithm for short nonbinary LDPC codes with Near-ML performance","display_name":"A two-stage decoding algorithm for short nonbinary LDPC codes with Near-ML performance","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2743300264","doi":"https://doi.org/10.1109/isit.2017.8006719","mag":"2743300264"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2017.8006719","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006719","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","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/A5015886027","display_name":"Dixia Deng","orcid":null},"institutions":[{"id":"https://openalex.org/I149594827","display_name":"Xidian University","ror":"https://ror.org/05s92vm98","country_code":"CN","type":"education","lineage":["https://openalex.org/I149594827"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Dixia Deng","raw_affiliation_strings":["State Key Laboratory of ISN, Xidian University, Xi'an, P. R. China"],"affiliations":[{"raw_affiliation_string":"State Key Laboratory of ISN, Xidian University, Xi'an, P. R. China","institution_ids":["https://openalex.org/I149594827"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072050516","display_name":"Hengzhou Xu","orcid":"https://orcid.org/0000-0001-9403-4460"},"institutions":[{"id":"https://openalex.org/I4210093674","display_name":"Zhoukou Normal University","ror":"https://ror.org/00jjkh886","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210093674"]},{"id":"https://openalex.org/I149594827","display_name":"Xidian University","ror":"https://ror.org/05s92vm98","country_code":"CN","type":"education","lineage":["https://openalex.org/I149594827"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hengzhou Xu","raw_affiliation_strings":["School of Network Engineering, Zhoukou Normal University, Zhoukou, P. R. China","State Key Laboratory of ISN, Xidian University, Xi'an, P. R. China"],"affiliations":[{"raw_affiliation_string":"School of Network Engineering, Zhoukou Normal University, Zhoukou, P. R. China","institution_ids":["https://openalex.org/I4210093674"]},{"raw_affiliation_string":"State Key Laboratory of ISN, Xidian University, Xi'an, P. R. China","institution_ids":["https://openalex.org/I149594827"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063124926","display_name":"Baoming Bai","orcid":"https://orcid.org/0000-0002-6161-5493"},"institutions":[{"id":"https://openalex.org/I149594827","display_name":"Xidian University","ror":"https://ror.org/05s92vm98","country_code":"CN","type":"education","lineage":["https://openalex.org/I149594827"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Baoming Bai","raw_affiliation_strings":["Xidian University, Xian, Shaanxi, CN"],"affiliations":[{"raw_affiliation_string":"Xidian University, Xian, Shaanxi, CN","institution_ids":["https://openalex.org/I149594827"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050717182","display_name":"Ji Zhang","orcid":"https://orcid.org/0000-0001-8299-6101"},"institutions":[{"id":"https://openalex.org/I149594827","display_name":"Xidian University","ror":"https://ror.org/05s92vm98","country_code":"CN","type":"education","lineage":["https://openalex.org/I149594827"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ji Zhang","raw_affiliation_strings":["State Key Laboratory of ISN, Xidian University, Xi'an, P. R. China"],"affiliations":[{"raw_affiliation_string":"State Key Laboratory of ISN, Xidian University, Xi'an, P. R. China","institution_ids":["https://openalex.org/I149594827"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5015886027"],"corresponding_institution_ids":["https://openalex.org/I149594827"],"apc_list":null,"apc_paid":null,"fwci":0.6216,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.72137726,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1202","last_page":"1206"},"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.9986000061035156,"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.9871000051498413,"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.8838476538658142},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7925457954406738},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.7179285883903503},{"id":"https://openalex.org/keywords/belief-propagation","display_name":"Belief propagation","score":0.6883487701416016},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6079773306846619},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.5352538228034973},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5066102743148804},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.4971297085285187},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.46895545721054077},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.44862252473831177},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.41297030448913574},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2800332009792328},{"id":"https://openalex.org/keywords/error-floor","display_name":"Error floor","score":0.2675851583480835},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.19218391180038452},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08029228448867798}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8838476538658142},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7925457954406738},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7179285883903503},{"id":"https://openalex.org/C152948882","wikidata":"https://www.wikidata.org/wiki/Q4060686","display_name":"Belief propagation","level":3,"score":0.6883487701416016},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6079773306846619},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.5352538228034973},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5066102743148804},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.4971297085285187},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.46895545721054077},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.44862252473831177},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.41297030448913574},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2800332009792328},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.2675851583480835},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.19218391180038452},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08029228448867798},{"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/isit.2017.8006719","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006719","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Symposium on Information Theory (ISIT)","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":14,"referenced_works":["https://openalex.org/W1571565904","https://openalex.org/W1966882038","https://openalex.org/W2006996870","https://openalex.org/W2008420412","https://openalex.org/W2044180609","https://openalex.org/W2097533304","https://openalex.org/W2102196824","https://openalex.org/W2109866575","https://openalex.org/W2119001152","https://openalex.org/W2119319086","https://openalex.org/W2173776306","https://openalex.org/W2510287032","https://openalex.org/W2517754505","https://openalex.org/W4300188436"],"related_works":["https://openalex.org/W2385322349","https://openalex.org/W2369600518","https://openalex.org/W2370284973","https://openalex.org/W2028976748","https://openalex.org/W4385859070","https://openalex.org/W4380030966","https://openalex.org/W2118148379","https://openalex.org/W1978153242","https://openalex.org/W2159021452","https://openalex.org/W2167340446"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"a":[3,26,53,75],"two-stage":[4],"decoding":[5,81],"algorithm":[6,50,90],"(called":[7],"BP-LED)":[8],"for":[9,35,69],"short":[10],"nonbinary":[11],"low-density":[12],"parity-check":[13],"(LDPC)":[14],"codes.":[15],"It":[16],"consists":[17],"of":[18,56],"the":[19,36,44,62,66,70,85],"classical":[20],"belief":[21],"propagation":[22],"(BP)":[23],"decoder":[24,29],"and":[25],"list":[27],"erasure":[28],"(LED).":[30],"Simulation":[31],"results":[32],"show":[33],"that,":[34],"(16,":[37],"8)":[38],"LDPC":[39],"code":[40],"over":[41],"GF(256)":[42],"in":[43,91],"CCSDS":[45],"standard,":[46],"our":[47],"proposed":[48,71],"BP-LED":[49],"can":[51],"achieve":[52],"coding":[54],"gain":[55],"0.6":[57],"dB":[58],"with":[59,79,84],"respect":[60],"to":[61],"FFT-QSPA.":[63],"By":[64],"choosing":[65],"parameters":[67],"suitable":[68],"algorithm,":[72],"it":[73],"has":[74],"negligible":[76],"performance":[77],"loss":[78],"lower":[80],"complexity":[82],"compared":[83],"BP-MRB":[86],"(most":[87],"reliable":[88],"basis)":[89],"[10].":[92]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}