{"id":"https://openalex.org/W2087556581","doi":"https://doi.org/10.1109/tit.2013.2284912","title":"On Decoding Irregular Tanner Codes With Local-Optimality Guarantees","display_name":"On Decoding Irregular Tanner Codes With Local-Optimality Guarantees","publication_year":2013,"publication_date":"2013-10-10","ids":{"openalex":"https://openalex.org/W2087556581","doi":"https://doi.org/10.1109/tit.2013.2284912","mag":"2087556581"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2013.2284912","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2013.2284912","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/A5109588180","display_name":"Nissim Halabi","orcid":null},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Nissim Halabi","raw_affiliation_strings":["Tel-Aviv University, School of Electrical Engineering, Tel-Aviv, Israel","Sch. of Electr. Eng., Tel-Aviv Univ., Tel-Aviv, Israel"],"affiliations":[{"raw_affiliation_string":"Tel-Aviv University, School of Electrical Engineering, Tel-Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Sch. of Electr. Eng., Tel-Aviv Univ., Tel-Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064059676","display_name":"Guy Even","orcid":"https://orcid.org/0000-0001-5407-330X"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Guy Even","raw_affiliation_strings":["Tel-Aviv University, School of Electrical Engineering, Tel-Aviv, Israel","Sch. of Electr. Eng., Tel-Aviv Univ., Tel-Aviv, Israel"],"affiliations":[{"raw_affiliation_string":"Tel-Aviv University, School of Electrical Engineering, Tel-Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Sch. of Electr. Eng., Tel-Aviv Univ., Tel-Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5109588180"],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":1.0874,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.81119826,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"60","issue":"1","first_page":"191","last_page":"211"},"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.9968000054359436,"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.996399998664856,"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/tanner-graph","display_name":"Tanner graph","score":0.8239322900772095},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7605700492858887},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.716454267501831},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.6984782814979553},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.5842106938362122},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.543212354183197},{"id":"https://openalex.org/keywords/parity-check-matrix","display_name":"Parity-check matrix","score":0.5211991667747498},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.5069677829742432},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48679444193840027},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4714922606945038},{"id":"https://openalex.org/keywords/girth","display_name":"Girth (graph theory)","score":0.45591506361961365},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.43224310874938965},{"id":"https://openalex.org/keywords/belief-propagation","display_name":"Belief propagation","score":0.41380468010902405},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3640541732311249},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.32824191451072693},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.2747512459754944},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.24868151545524597},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.09479501843452454}],"concepts":[{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.8239322900772095},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7605700492858887},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.716454267501831},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.6984782814979553},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.5842106938362122},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.543212354183197},{"id":"https://openalex.org/C95925971","wikidata":"https://www.wikidata.org/wiki/Q3100414","display_name":"Parity-check matrix","level":4,"score":0.5211991667747498},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.5069677829742432},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48679444193840027},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4714922606945038},{"id":"https://openalex.org/C2777434295","wikidata":"https://www.wikidata.org/wiki/Q959831","display_name":"Girth (graph theory)","level":2,"score":0.45591506361961365},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.43224310874938965},{"id":"https://openalex.org/C152948882","wikidata":"https://www.wikidata.org/wiki/Q4060686","display_name":"Belief propagation","level":3,"score":0.41380468010902405},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3640541732311249},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.32824191451072693},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.2747512459754944},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.24868151545524597},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.09479501843452454}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.2013.2284912","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2013.2284912","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320273","display_name":"University of Cambridge","ror":"https://ror.org/013meh722"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W7241855","https://openalex.org/W1497193185","https://openalex.org/W1536930200","https://openalex.org/W1537344883","https://openalex.org/W1588943481","https://openalex.org/W1965084720","https://openalex.org/W1969880716","https://openalex.org/W1970907073","https://openalex.org/W1970912697","https://openalex.org/W1993508000","https://openalex.org/W2019441424","https://openalex.org/W2033546746","https://openalex.org/W2035929826","https://openalex.org/W2067554595","https://openalex.org/W2098387242","https://openalex.org/W2103160098","https://openalex.org/W2108619558","https://openalex.org/W2114364830","https://openalex.org/W2115104320","https://openalex.org/W2118552378","https://openalex.org/W2121606987","https://openalex.org/W2127370988","https://openalex.org/W2128765501","https://openalex.org/W2133068391","https://openalex.org/W2135764410","https://openalex.org/W2137699000","https://openalex.org/W2138236884","https://openalex.org/W2139164285","https://openalex.org/W2141975070","https://openalex.org/W2142511915","https://openalex.org/W2169134868","https://openalex.org/W2169732368","https://openalex.org/W2175308498","https://openalex.org/W2176504112","https://openalex.org/W2293231900","https://openalex.org/W2568713596","https://openalex.org/W2949560198","https://openalex.org/W2963827650","https://openalex.org/W3099476509","https://openalex.org/W3106495992","https://openalex.org/W4300188436","https://openalex.org/W6632343532","https://openalex.org/W6635197353","https://openalex.org/W6642983288"],"related_works":["https://openalex.org/W3212819824","https://openalex.org/W4297803167","https://openalex.org/W3167562836","https://openalex.org/W4302175014","https://openalex.org/W2952823298","https://openalex.org/W2150639697","https://openalex.org/W4287029234","https://openalex.org/W2034577597","https://openalex.org/W3080746295","https://openalex.org/W2904381917"],"abstract_inverted_index":{"We":[0,22,138,163,204],"consider":[1],"decoding":[2,11,15,170,178,234,242,247,272,303,319],"of":[3,37,55,62,81,89,107,110,118,228,244,260,301,332],"binary":[4,190],"linear":[5],"Tanner":[6,42,91,112,191,230,291,334],"codes":[7,43,197],"using":[8],"message-passing":[9,168],"iterative":[10,169],"and":[12,65,70,74,151,154,200,293],"linear-programming":[13],"(LP)":[14],"in":[16,40,85,121,143,238,304,329],"memoryless":[17],"binary-input":[18],"output-symmetric":[19],"(MBIOS)":[20],"channels.":[21,306],"present":[23,165],"new":[24,145,167,286],"certificates":[25],"that":[26,140,156,185,206,264,317],"are":[27,124,132],"based":[28,76],"on":[29,77,297],"a":[30,38,53,78,157,166,180,208,253,261],"combinatorial":[31],"characterization":[32,51,146,288],"for":[33,279],"the":[34,86,90,108,111,116,226,229,245,267,271,285,298,308,315,323,330,333],"local":[35,141,196,258],"optimality":[36,142,150,259],"codeword":[39,211,237,262,325],"irregular":[41,189],"with":[44,193,212],"respect":[45,213],"to":[46,127,135,187,214,289,321],"any":[47,97,188],"MBIOS":[48,305],"channel.":[49],"This":[50],"is":[52,75,179,222,266,310],"generalization":[54],"(Arora":[56],",":[57],"Proc.":[58,67],"ACM":[59],"Symp.":[60],"Theory":[61,69],"Computing,":[63],"2009)":[64],"(Vontobel,":[66],"Inf.":[68],"Appl.":[71],"Workshop,":[72],"2010)":[73],"conical":[79],"combination":[80],"normalized":[82,173],"weighted":[83,174],"subtrees":[84,94,123,131],"computation":[87],"trees":[88],"graph.":[92,335],"These":[93],"may":[95],"have":[96],"finite":[98],"height":[99,215],"h":[100,217,221,239],"(even":[101],"equal":[102],"or":[103],"greater":[104],"than":[105],"half":[106],"girth":[109,227,331],"graph).":[113],"In":[114],"addition,":[115],"degrees":[117],"local-code":[119],"nodes":[120],"these":[122,130,312],"not":[125,133,223],"restricted":[126,134],"two":[128],"(i.e.,":[129],"skinny":[136],"trees).":[137],"prove":[139,205,294],"this":[144,236,280],"implies":[147,263],"maximum-likelihood":[148],"(ML)":[149],"LP":[152,302,318],"optimality,":[153],"show":[155],"certificate":[158,278],"can":[159],"be":[160],"computed":[161],"efficiently.":[162],"also":[164,274],"algorithm,":[171],"called":[172],"min-sum":[175],"(NWMS).":[176],"NWMS":[177,233,246],"belief-propagation":[181],"(BP)":[182],"type":[183],"algorithm":[184,248],"applies":[186,249],"code":[192],"single":[194],"parity-check":[195,202],"(e.g.,":[198],"low-density":[199],"high-density":[201],"codes).":[203],"if":[207],"locally":[209,254],"optimal":[210,255],"parameter":[216],"exists":[218,252],"(whereby":[219],"notably":[220],"limited":[224],"by":[225],"graph),":[231],"then":[232],"finds":[235],"iterations.":[240],"The":[241],"guarantee":[243,273],"whenever":[250],"there":[251],"codeword.":[256,281],"Because":[257],"it":[265],"unique":[268],"ML":[269,277],"codeword,":[270],"provides":[275],"an":[276],"Finally,":[282],"we":[283],"apply":[284],"local-optimality":[287],"regular":[290],"codes,":[292],"lower":[295,313],"bounds":[296],"noise":[299,309],"thresholds":[300],"When":[307],"below":[311],"bounds,":[314],"probability":[316],"fails":[320],"decode":[322],"transmitted":[324],"decays":[326],"doubly":[327],"exponentially":[328]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}