{"id":"https://openalex.org/W2383392872","doi":null,"title":"Simplified decoding algorithm for LDPC over GF(q)","display_name":"Simplified decoding algorithm for LDPC over GF(q)","alternate_titles":[],"publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2383392872","mag":"2383392872"},"language":"en","primary_location":{"id":"mag:2383392872","doi":null,"is_oa":false,"landing_page_url":"https://oversea.cnki.net/kcms/detail/detail.aspx?dbcode=CJFD&filename=XDKD201102003","pdf_url":null,"source":{"id":"https://openalex.org/S4210223468","display_name":"Journal of Xidian University","issn_l":"1001-2400","issn":["1001-2400"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["norway-1","poland-40","russia-white-list-4"],"host_organization":"https://openalex.org/P4310319982","host_organization_name":"Science Press","host_organization_lineage":["https://openalex.org/P4310319982"],"host_organization_lineage_names":["Science Press"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Journal of Xidian University","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W2383392872"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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/A5032011366","display_name":"Xinmei Wang","orcid":"https://orcid.org/0000-0002-2874-0946","observed_orcids":["https://orcid.org/0000-0002-2874-0946"]},"institutions":[],"countries":[],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Xinmei Wang","raw_affiliation_strings":["State Key Lab"],"raw_orcid":"https://orcid.org/0000-0002-2874-0946","affiliations":[{"raw_affiliation_string":"State Key Lab","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5032011366"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3396,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.63110443,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":92},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":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/T11130","display_name":"Coding theory and cryptography","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.0,"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/low-density-parity-check-codes","display_name":"LDPC codes","score":0.968999981880188},{"id":"https://openalex.org/keywords/decoding-algorithms","display_name":"decoding algorithms","score":0.7250000238418579},{"id":"https://openalex.org/keywords/log-likelihood-ratio","display_name":"log-likelihood ratio","score":0.7609999775886536},{"id":"https://openalex.org/keywords/sum-product-algorithm","display_name":"sum-product algorithm","score":0.9950000047683716},{"id":"https://openalex.org/keywords/check-node-update","display_name":"check node update","score":0.8059999942779541},{"id":"https://openalex.org/keywords/taylor-expansion","display_name":"Taylor series expansion","score":0.7580000162124634},{"id":"https://openalex.org/keywords/binary-error-rate","display_name":"binary error rate","score":0.414000004529953}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7688971161842346},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.6218185424804688},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.6214736104011536},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6117473840713501},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5327187776565552},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5149232149124146},{"id":"https://openalex.org/C175291020","wikidata":"https://www.wikidata.org/wiki/Q1156822","display_name":"Offset (computer science)","level":2,"score":0.47152218222618103},{"id":"https://openalex.org/C156350748","wikidata":"https://www.wikidata.org/wiki/Q5513324","display_name":"GF(2)","level":3,"score":0.463728129863739},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3634026348590851},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2978477478027344},{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.28862494230270386},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2383392872","doi":null,"is_oa":false,"landing_page_url":"https://oversea.cnki.net/kcms/detail/detail.aspx?dbcode=CJFD&filename=XDKD201102003","pdf_url":null,"source":{"id":"https://openalex.org/S4210223468","display_name":"Journal of Xidian University","issn_l":"1001-2400","issn":["1001-2400"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["norway-1","poland-40","russia-white-list-4"],"host_organization":"https://openalex.org/P4310319982","host_organization_name":"Science Press","host_organization_lineage":["https://openalex.org/P4310319982"],"host_organization_lineage_names":["Science Press"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Journal of Xidian University","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W786601960","https://openalex.org/W2036614138","https://openalex.org/W2001300199","https://openalex.org/W2160926969","https://openalex.org/W2914406762","https://openalex.org/W7096435725","https://openalex.org/W2544367090","https://openalex.org/W2119861535","https://openalex.org/W2003230827","https://openalex.org/W1484354944"],"abstract_inverted_index":{"A":[0],"simple,yet":[1],"effective":[2],"decoding":[3],"algorithm":[4,38,57,75],"for":[5],"LDPC(low-density":[6],"parity-check)":[7],"codes":[8],"over":[9],"GF(q)":[10],"is":[11],"presented.By":[12],"taking":[13],"advantages":[14],"of":[15,26,47,61,67,73,78,81],"the":[16,23,27,42,48,52,65,69,79,82],"first-term":[17],"Taylor's":[18],"series":[19],"expansion":[20],"to":[21,51],"approximate":[22],"correction":[24],"term":[25],"Jacobian":[28],"logarithm":[29],"used":[30],"in":[31],"LLR-SPA(log-likelihood":[32],"ratio":[33],"sum-product":[34],"algorithm),we":[35],"propose":[36],"an":[37],"which":[39],"significantly":[40],"simplifies":[41],"check":[43],"node":[44],"update":[45],"computation":[46],"optimal":[49],"LLR-SPA.Compared":[50],"offset":[53,70],"min-sum":[54,71],"algorithm,the":[55],"proposed":[56],"achieves":[58],"a":[59],"gain":[60],"about":[62],"0.2dB":[63],"at":[64],"BER":[66],"10-4.Moreover,unlike":[68],"algorithm,parameters":[72],"this":[74],"are":[76],"independent":[77],"order":[80],"Galois":[83],"Filed.":[84]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2383392872","counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
