{"id":"https://openalex.org/W2113498323","doi":"https://doi.org/10.1109/tit.2009.2016025","title":"Reversible Low-Density Parity-Check Codes","display_name":"Reversible Low-Density Parity-Check Codes","publication_year":2009,"publication_date":"2009-04-22","ids":{"openalex":"https://openalex.org/W2113498323","doi":"https://doi.org/10.1109/tit.2009.2016025","mag":"2113498323"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2009.2016025","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2009.2016025","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-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/A5071114345","display_name":"David Haley","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"David Haley","raw_affiliation_strings":["Cohda Wireless Private Limited, Kent Town, SA, Australia","Cohda Wireless, Kent Town, SA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Cohda Wireless Private Limited, Kent Town, SA, Australia","institution_ids":[]},{"raw_affiliation_string":"Cohda Wireless, Kent Town, SA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072485708","display_name":"Alex Grant","orcid":"https://orcid.org/0000-0002-5345-7771"},"institutions":[{"id":"https://openalex.org/I170239107","display_name":"University of South Australia","ror":"https://ror.org/01p93h210","country_code":"AU","type":"education","lineage":["https://openalex.org/I170239107"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Alex Grant","raw_affiliation_strings":["Institute of Telecommunications Research, University of South Australia, Mawson Lakes, SA, Australia","[Inst. for Telecommun. Res., Univ. of South Australia, Mawson Lakes, SA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Telecommunications Research, University of South Australia, Mawson Lakes, SA, Australia","institution_ids":["https://openalex.org/I170239107"]},{"raw_affiliation_string":"[Inst. for Telecommun. Res., Univ. of South Australia, Mawson Lakes, SA]","institution_ids":["https://openalex.org/I170239107"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.8368,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.91307854,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"55","issue":"5","first_page":"2016","last_page":"2036"},"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.9977999925613403,"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.9954000115394592,"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.7099220156669617},{"id":"https://openalex.org/keywords/factor-graph","display_name":"Factor graph","score":0.6473885774612427},{"id":"https://openalex.org/keywords/encoder","display_name":"Encoder","score":0.519180417060852},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48535242676734924},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.48025014996528625},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4793035089969635},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.4665731191635132},{"id":"https://openalex.org/keywords/parity-check-matrix","display_name":"Parity-check matrix","score":0.44379180669784546},{"id":"https://openalex.org/keywords/circulant-matrix","display_name":"Circulant matrix","score":0.4423127770423889},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.4387041926383972},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.43826672434806824},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.42764484882354736},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3558131456375122},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.3278735876083374}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.7099220156669617},{"id":"https://openalex.org/C159246509","wikidata":"https://www.wikidata.org/wiki/Q5428725","display_name":"Factor graph","level":3,"score":0.6473885774612427},{"id":"https://openalex.org/C118505674","wikidata":"https://www.wikidata.org/wiki/Q42586063","display_name":"Encoder","level":2,"score":0.519180417060852},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48535242676734924},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.48025014996528625},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4793035089969635},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.4665731191635132},{"id":"https://openalex.org/C95925971","wikidata":"https://www.wikidata.org/wiki/Q3100414","display_name":"Parity-check matrix","level":4,"score":0.44379180669784546},{"id":"https://openalex.org/C115973184","wikidata":"https://www.wikidata.org/wiki/Q245457","display_name":"Circulant matrix","level":2,"score":0.4423127770423889},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.4387041926383972},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.43826672434806824},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42764484882354736},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3558131456375122},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.3278735876083374},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tit.2009.2016025","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2009.2016025","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},{"id":"pmh:oai:urm_publish:9915910882901831","is_oa":false,"landing_page_url":"https://hdl.handle.net/1959.8/114936","pdf_url":null,"source":{"id":"https://openalex.org/S4306402528","display_name":"UniSA Research Outputs Repository (University of South Australia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I170239107","host_organization_name":"University of South Australia","host_organization_lineage":["https://openalex.org/I170239107"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":49,"referenced_works":["https://openalex.org/W143490652","https://openalex.org/W561993775","https://openalex.org/W1515850956","https://openalex.org/W1538894044","https://openalex.org/W1545748428","https://openalex.org/W1562327279","https://openalex.org/W1571565904","https://openalex.org/W1580362924","https://openalex.org/W1602268444","https://openalex.org/W1631603072","https://openalex.org/W1818146586","https://openalex.org/W1973712217","https://openalex.org/W2001732758","https://openalex.org/W2040075573","https://openalex.org/W2060945600","https://openalex.org/W2087392909","https://openalex.org/W2095882513","https://openalex.org/W2098068152","https://openalex.org/W2099940667","https://openalex.org/W2102520548","https://openalex.org/W2107301532","https://openalex.org/W2111319461","https://openalex.org/W2111541156","https://openalex.org/W2114869758","https://openalex.org/W2115104320","https://openalex.org/W2119317994","https://openalex.org/W2128765501","https://openalex.org/W2133068391","https://openalex.org/W2135764410","https://openalex.org/W2137699000","https://openalex.org/W2137813581","https://openalex.org/W2140655888","https://openalex.org/W2147564076","https://openalex.org/W2149231487","https://openalex.org/W2153976062","https://openalex.org/W2155469840","https://openalex.org/W2163015886","https://openalex.org/W2166972237","https://openalex.org/W2293231900","https://openalex.org/W2495694953","https://openalex.org/W2895239415","https://openalex.org/W4235946010","https://openalex.org/W4300188436","https://openalex.org/W4392750738","https://openalex.org/W6605871153","https://openalex.org/W6615712716","https://openalex.org/W6632091454","https://openalex.org/W6682845314","https://openalex.org/W6684112390"],"related_works":["https://openalex.org/W2073199959","https://openalex.org/W4247927056","https://openalex.org/W1968396483","https://openalex.org/W4297536019","https://openalex.org/W1509734363","https://openalex.org/W135568846","https://openalex.org/W2913933112","https://openalex.org/W2950636389","https://openalex.org/W2147254059","https://openalex.org/W2058933018"],"abstract_inverted_index":{"Low-density":[0],"parity-check":[1],"(LDPC)":[2],"codes":[3,121,128,173],"may":[4],"be":[5,32,93],"decoded":[6],"using":[7,34,122],"a":[8,130,137,163],"circuit":[9],"implementation":[10],"of":[11,20,55,108,126,148,179],"the":[12,17,21,25,35,52,56,85,106,141,155,159,177],"sum-product":[13],"algorithm":[14],"which":[15,63],"maps":[16],"factor":[18,142],"graph":[19,145],"code.":[22],"By":[23],"reusing":[24],"decoder":[26],"for":[27,88,166],"encoding,":[28],"both":[29],"tasks":[30],"can":[31,92],"performed":[33],"same":[36],"circuit,":[37],"thus":[38],"reducing":[39],"area":[40],"and":[41,69,103,182,184,193],"verification":[42],"requirements.":[43],"Motivated":[44],"by":[45],"this,":[46],"iterative":[47,89,110],"encoding":[48],"techniques":[49],"based":[50],"upon":[51],"graphical":[53],"representation":[54],"code":[57,180],"are":[58,67],"proposed.":[59],"Code":[60],"design":[61,73],"constraints":[62],"ensure":[64],"encoder":[65],"convergence":[66],"presented,":[68],"then":[70],"used":[71],"to":[72,95,136,153,189],"iteratively":[74,119,168],"encodable":[75,120,169],"codes,":[76],"while":[77],"also":[78],"preventing":[79],"4-cycle":[80],"creation.":[81],"We":[82,112],"show":[83],"how":[84],"Jacobi":[86],"method":[87],"matrix":[90],"inversion":[91],"applied":[94],"finite":[96],"field":[97],"matrices,":[98],"viewed":[99],"as":[100,105],"message":[101],"passing,":[102],"employed":[104],"core":[107],"an":[109,114],"encoder.":[111],"present":[113],"algebraic":[115],"construction":[116],"of4-cycle":[117],"free":[118],"circulant":[123],"matrices.":[124],"Analysis":[125],"these":[127],"identifies":[129],"weakness":[131],"in":[132,140,158,176],"their":[133],"structure,":[134],"due":[135],"repetitive":[138,156],"pattern":[139,157],"graph.":[143],"The":[144,171],"supports":[146],"pseudo-codewords":[147],"low":[149],"pseudo-weight.":[150],"In":[151],"order":[152],"remove":[154],"graph,":[160],"we":[161],"propose":[162],"recursive":[164],"technique":[165],"generating":[167],"codes.":[170,196],"new":[172],"offer":[174],"flexibility":[175],"choice":[178],"length":[181],"rate,":[183],"performance":[185],"that":[186],"compares":[187],"well":[188],"randomly":[190],"generated,":[191],"quasi-cyclic":[192],"extended":[194],"Euclidean-geometry":[195]},"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2016-06-24T00:00:00"}