{"id":"https://openalex.org/W3149174425","doi":"https://doi.org/10.1109/acssc.2011.6190138","title":"Improved iterative soft-reliability-based majority-logic decoding algorithm for non-binary low-density parity-check codes","display_name":"Improved iterative soft-reliability-based majority-logic decoding algorithm for non-binary low-density parity-check codes","publication_year":2011,"publication_date":"2011-11-01","ids":{"openalex":"https://openalex.org/W3149174425","doi":"https://doi.org/10.1109/acssc.2011.6190138","mag":"3149174425"},"language":"en","primary_location":{"id":"doi:10.1109/acssc.2011.6190138","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acssc.2011.6190138","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR)","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/A5045362410","display_name":"Chenrong Xiong","orcid":"https://orcid.org/0000-0002-1053-9929"},"institutions":[{"id":"https://openalex.org/I186143895","display_name":"Lehigh University","ror":"https://ror.org/012afjb06","country_code":"US","type":"education","lineage":["https://openalex.org/I186143895"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chenrong Xiong","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Lehigh University, Bethlehem, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Lehigh University, Bethlehem, PA, USA","institution_ids":["https://openalex.org/I186143895"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101582861","display_name":"Zhiyuan Yan","orcid":"https://orcid.org/0000-0003-2286-2771"},"institutions":[{"id":"https://openalex.org/I186143895","display_name":"Lehigh University","ror":"https://ror.org/012afjb06","country_code":"US","type":"education","lineage":["https://openalex.org/I186143895"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhiyuan Yan","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Lehigh University, Bethlehem, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Lehigh University, Bethlehem, PA, USA","institution_ids":["https://openalex.org/I186143895"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I186143895"],"apc_list":null,"apc_paid":null,"fwci":2.2881,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.89752561,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"894","last_page":"898"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"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":0.9998999834060669,"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/T12029","display_name":"DNA and Biological Computing","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9934999942779541,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/decoding-methods","display_name":"Decoding methods","score":0.7084466218948364},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6059072017669678},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.6014035940170288},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5487034916877747},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.5273930430412292},{"id":"https://openalex.org/keywords/reliability","display_name":"Reliability (semiconductor)","score":0.5163401365280151},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.48716089129447937},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4867532253265381},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.4170493483543396},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35189875960350037},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.31516551971435547},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2890217900276184},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.20938631892204285},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.17900115251541138},{"id":"https://openalex.org/keywords/error-floor","display_name":"Error floor","score":0.15624338388442993},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.08378323912620544}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7084466218948364},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6059072017669678},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.6014035940170288},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5487034916877747},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.5273930430412292},{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.5163401365280151},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.48716089129447937},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4867532253265381},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.4170493483543396},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35189875960350037},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.31516551971435547},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2890217900276184},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.20938631892204285},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.17900115251541138},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.15624338388442993},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.08378323912620544},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/acssc.2011.6190138","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acssc.2011.6190138","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR)","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":10,"referenced_works":["https://openalex.org/W2046073577","https://openalex.org/W2102986410","https://openalex.org/W2109866575","https://openalex.org/W2119001152","https://openalex.org/W2122079707","https://openalex.org/W2127490352","https://openalex.org/W2143687662","https://openalex.org/W2144843341","https://openalex.org/W2173776306","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/W2050784748","https://openalex.org/W2383267581","https://openalex.org/W2102627024","https://openalex.org/W2182594114","https://openalex.org/W2127999627","https://openalex.org/W2010879611"],"abstract_inverted_index":{"Non-binary":[0],"low-density":[1],"parity-check":[2],"(LDPC)":[3],"codes":[4],"have":[5],"some":[6],"advantages":[7],"as":[8,46,48],"opposed":[9],"to":[10],"their":[11,16],"binary":[12],"counterparts,":[13],"but":[14,149],"unfortunately":[15],"decoding":[17,29,62,127,134,159],"complexity":[18],"is":[19,31,161],"a":[20,66,89,105,118,188],"significant":[21],"challenge.":[22],"Hence,":[23],"the":[24,83,101,112,124,131,136,140,156,164,171,175,183],"iterative":[25],"soft-reliability-based":[26],"(ISRB)":[27],"majority-logic":[28,61,126,133,158],"algorithm":[30,63,72,103,138,160],"attractive":[32],"for":[33,88],"non-binary":[34],"LDPC":[35,97],"codes,":[36],"since":[37],"it":[38],"involves":[39],"only":[40],"finite":[41,144],"field":[42,145],"additions":[43,50,146,152],"and":[44,51,77,110,147,153,169,192],"multiplications":[45,148],"well":[47],"integer":[49,151],"comparisons.":[52,154],"In":[53,181],"this":[54],"paper,":[55],"we":[56],"propose":[57],"an":[58],"improved":[59,71],"ISRB":[60,125,132,157],"by":[64,115],"using":[65],"new":[67],"reliability":[68,167,176,185],"update.":[69],"Our":[70],"achieves":[73,104],"better":[74],"error":[75,120],"performance":[76],"faster":[78],"convergence,":[79],"while":[80],"further":[81],"reducing":[82],"computational":[84],"complexity.":[85],"For":[86],"instance,":[87],"(16,":[90],"16)-regular":[91],"(255,":[92],"175)":[93],"cyclic":[94],"Euclidean":[95],"geometry":[96],"code":[98],"over":[99],"GF(28),":[100],"proposed":[102,137,184],"0.15":[106],"dB":[107],"coding":[108],"gain":[109],"improves":[111],"convergence":[113],"speed":[114],"10%":[116],"at":[117],"block":[119],"rate":[121],"of":[122,143,166,174],"10-4versus":[123],"algorithm.":[128],"Compared":[129],"with":[130,179],"algorithm,":[135],"requires":[139],"same":[141],"numbers":[142],"fewer":[150],"Furthermore,":[155],"based":[162],"on":[163],"accumulation":[165],"information,":[168],"hence":[170],"numerical":[172,190],"range":[173,191],"information":[177],"increases":[178],"iterations.":[180],"contrast,":[182],"update":[186],"has":[187],"fixed":[189],"thus":[193],"simplifies":[194],"hardware":[195],"implementations.":[196]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":3}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}