{"id":"https://openalex.org/W2027081428","doi":"https://doi.org/10.1109/isit.2005.1523566","title":"Improved reversible LDPC codes","display_name":"Improved reversible LDPC codes","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2027081428","doi":"https://doi.org/10.1109/isit.2005.1523566","mag":"2027081428"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2005.1523566","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523566","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","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/A5071114345","display_name":"David Haley","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"D. Haley","raw_affiliation_strings":["Cohda Wireless, Kent Town, SA, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Cohda Wireless, Kent Town, SA, Australia","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":"A. Grant","raw_affiliation_strings":["Institute for Telecommunications Research, University of South Australia, SA, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Telecommunications Research, University of South Australia, SA, Australia","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":0.9808,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.76309576,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1367","last_page":"1371"},"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.9929999709129333,"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.9882000088691711,"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.826221227645874},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.593147873878479},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5681354999542236},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.552699089050293},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5402292013168335},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5323057174682617},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5035294890403748},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4900866746902466},{"id":"https://openalex.org/keywords/raptor-code","display_name":"Raptor code","score":0.4709925055503845},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.4687376618385315},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.46671149134635925},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.419277548789978},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.3429816961288452},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32839441299438477},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12505701184272766},{"id":"https://openalex.org/keywords/error-floor","display_name":"Error floor","score":0.10719004273414612}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.826221227645874},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.593147873878479},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5681354999542236},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.552699089050293},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5402292013168335},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5323057174682617},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5035294890403748},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4900866746902466},{"id":"https://openalex.org/C101252705","wikidata":"https://www.wikidata.org/wiki/Q7294373","display_name":"Raptor code","level":5,"score":0.4709925055503845},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.4687376618385315},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.46671149134635925},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.419277548789978},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3429816961288452},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32839441299438477},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12505701184272766},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.10719004273414612},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"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":2,"locations":[{"id":"doi:10.1109/isit.2005.1523566","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523566","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.67.3309","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.67.3309","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.itr.unisa.edu.au/~steven/turbo/ISIT05c.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1578407121","https://openalex.org/W1602268444","https://openalex.org/W1818146586","https://openalex.org/W2001732758","https://openalex.org/W2027081428","https://openalex.org/W2029712200","https://openalex.org/W2060945600","https://openalex.org/W2095882513","https://openalex.org/W2107301532","https://openalex.org/W2111541156","https://openalex.org/W2114869758","https://openalex.org/W2128765501","https://openalex.org/W2133068391","https://openalex.org/W2137813581","https://openalex.org/W2140655888","https://openalex.org/W2147564076","https://openalex.org/W4300188436"],"related_works":["https://openalex.org/W2139745099","https://openalex.org/W2147429396","https://openalex.org/W2901164849","https://openalex.org/W2391555801","https://openalex.org/W2126543779","https://openalex.org/W2169710030","https://openalex.org/W2209506458","https://openalex.org/W2140479584","https://openalex.org/W2142451577","https://openalex.org/W58580312"],"abstract_inverted_index":{"We":[0,64,84],"provide":[1],"a":[2,6,45,57,87,104],"thorough":[3],"analysis":[4,43],"for":[5,36,91],"class":[7],"of":[8,24,50,71,81,107,112],"iteratively":[9,93],"encodable":[10,94],"low-density":[11],"parity-check":[12],"codes.":[13],"The":[14,42,100],"iterative":[15],"encoding":[16],"technique":[17,90],"is":[18],"based":[19],"upon":[20],"the":[21,25,29,48,51,67,78,110],"graphical":[22],"representation":[23],"code":[26,113],"and":[27,74,115,117,126],"allows":[28],"decoder":[30],"circuit":[31,40],"to":[32,56,77,122],"also":[33],"be":[34],"used":[35],"encoding,":[37],"thus":[38],"saving":[39],"area.":[41],"identifies":[44],"weakness":[46],"in":[47,60,109],"structure":[49],"code,":[52],"which":[53,96],"arises":[54],"due":[55],"repetitive":[58],"pattern":[59],"its":[61],"factor":[62],"graph.":[63],"show":[65],"that":[66,119],"graph":[68],"supports":[69],"pseudo-codewords":[70],"low":[72],"pseudo-weight,":[73],"relate":[75],"this":[76],"empirical":[79],"observation":[80],"some":[82],"near-codewords.":[83],"then":[85],"propose":[86],"new":[88,101],"recursive":[89],"constructing":[92],"codes":[95,102,129],"have":[97],"improved":[98],"expansion.":[99],"offer":[103],"large":[105],"amount":[106],"flexibility":[108],"choice":[111],"length":[114],"rate,":[116],"performance":[118],"compares":[120],"well":[121],"both":[123],"randomly":[124],"generated":[125],"extended":[127],"Euclidean-geometry":[128]},"counts_by_year":[{"year":2014,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}