{"id":"https://openalex.org/W2007251729","doi":"https://doi.org/10.1109/isit.2014.6875418","title":"On the error-correcting capabilities of low-complexity decoded irregular LDPC codes","display_name":"On the error-correcting capabilities of low-complexity decoded irregular LDPC codes","publication_year":2014,"publication_date":"2014-06-01","ids":{"openalex":"https://openalex.org/W2007251729","doi":"https://doi.org/10.1109/isit.2014.6875418","mag":"2007251729"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2014.6875418","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2014.6875418","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Symposium on Information Theory","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/A5052831471","display_name":"Pavel Rybin","orcid":"https://orcid.org/0000-0002-8255-2161"},"institutions":[{"id":"https://openalex.org/I4210107660","display_name":"Institute for Information Transmission Problems","ror":"https://ror.org/013w2d378","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210097085","https://openalex.org/I4210107660"]},{"id":"https://openalex.org/I1313323035","display_name":"Russian Academy of Sciences","ror":"https://ror.org/05qrfxd25","country_code":"RU","type":"funder","lineage":["https://openalex.org/I1313323035"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Pavel Rybin","raw_affiliation_strings":["Inst. for Information Transmission Problems, Russian Academy of Science, Moscow, Russia","Russian Academy of Sciences, Moscow, Russia"],"affiliations":[{"raw_affiliation_string":"Inst. for Information Transmission Problems, Russian Academy of Science, Moscow, Russia","institution_ids":["https://openalex.org/I4210107660"]},{"raw_affiliation_string":"Russian Academy of Sciences, Moscow, Russia","institution_ids":["https://openalex.org/I1313323035"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5052831471"],"corresponding_institution_ids":["https://openalex.org/I1313323035","https://openalex.org/I4210107660"],"apc_list":null,"apc_paid":null,"fwci":1.3792,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.83085129,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"3165","last_page":"3169"},"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.9987000226974487,"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.996999979019165,"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.9547202587127686},{"id":"https://openalex.org/keywords/tanner-graph","display_name":"Tanner graph","score":0.6030986905097961},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5891627073287964},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.586172878742218},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5812951922416687},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5699049830436707},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.4958239495754242},{"id":"https://openalex.org/keywords/serial-concatenated-convolutional-codes","display_name":"Serial concatenated convolutional codes","score":0.4898233115673065},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4721037447452545},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.46214282512664795},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.4517195224761963},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3950040340423584},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3360554575920105},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.3215790390968323},{"id":"https://openalex.org/keywords/error-floor","display_name":"Error floor","score":0.277521550655365}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.9547202587127686},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.6030986905097961},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5891627073287964},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.586172878742218},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5812951922416687},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5699049830436707},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.4958239495754242},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.4898233115673065},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4721037447452545},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.46214282512664795},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.4517195224761963},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3950040340423584},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3360554575920105},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3215790390968323},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.277521550655365},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"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":1,"locations":[{"id":"doi:10.1109/isit.2014.6875418","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2014.6875418","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.4399999976158142}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1991705942","https://openalex.org/W2001777589","https://openalex.org/W2005606852","https://openalex.org/W2050612395","https://openalex.org/W2078745808","https://openalex.org/W2092124262","https://openalex.org/W2128308724","https://openalex.org/W2130458083","https://openalex.org/W2133068391","https://openalex.org/W2163496715","https://openalex.org/W2170758137","https://openalex.org/W2762711634","https://openalex.org/W3103902416","https://openalex.org/W4300188436"],"related_works":["https://openalex.org/W2139745099","https://openalex.org/W2015101254","https://openalex.org/W2132566027","https://openalex.org/W1782566311","https://openalex.org/W1968988046","https://openalex.org/W2127950068","https://openalex.org/W2373473769","https://openalex.org/W2126543779","https://openalex.org/W2169710030","https://openalex.org/W2105694638"],"abstract_inverted_index":{"This":[0,54],"paper":[1,99],"deals":[2],"with":[3,11],"the":[4,12,20,30,36,43,48,80,87,95,98,108,121,125],"irregular":[5,44,69,126],"binary":[6],"low-density":[7],"parity-check":[8],"(LDPC)":[9],"codes":[10,18,116],"constituent":[13],"single":[14],"parity":[15],"check":[16],"(SPC)":[17],"and":[19,117],"error-correcting":[21],"iterative":[22,38],"low-complex":[23],"decoding":[24,75],"algorithm.":[25],"The":[26,72,90],"lower":[27,55,102],"bound":[28,56,103],"on":[29],"error":[31],"fraction,":[32],"guaranteed":[33],"corrected":[34],"by":[35],"considered":[37],"algorithm,":[39],"was":[40,57],"obtained":[41,58,93],"for":[42,47,100,107,113,120,124],"LDPC":[45,70,115,127],"code":[46,88],"first":[49,122],"time":[50,123],"in":[51],"this":[52],"paper.":[53],"as":[59],"a":[60,83],"result":[61],"of":[62,64,68,74,86,97],"analysis":[63],"Tanner":[65],"graph":[66],"representation":[67],"code.":[71],"number":[73],"iterations,":[76],"required":[77],"to":[78],"correct":[79],"errors,":[81],"is":[82],"logarithmic":[84],"function":[85],"length.":[89],"numerical":[91],"results,":[92],"at":[94],"end":[96],"proposed":[101],"achieved":[104],"similar":[105],"results":[106],"previously":[109],"known":[110],"best":[111],"lower-bounds":[112],"regular":[114],"were":[118],"represented":[119],"codes.":[128]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}