{"id":"https://openalex.org/W2034577597","doi":"https://doi.org/10.1109/isit.2012.6284007","title":"Linear-programming decoding of Tanner codes with local-optimality certificates","display_name":"Linear-programming decoding of Tanner codes with local-optimality certificates","publication_year":2012,"publication_date":"2012-07-01","ids":{"openalex":"https://openalex.org/W2034577597","doi":"https://doi.org/10.1109/isit.2012.6284007","mag":"2034577597"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2012.6284007","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2012.6284007","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Symposium on Information Theory Proceedings","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/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":false,"raw_author_name":"Nissim Halabi","raw_affiliation_strings":["School of Electrical Engineering, Tel Aviv University, Tel-Aviv, Israel","School of Electrical Engineering , Tel-Aviv University , Tel-Aviv 69978 , Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering, Tel Aviv University, Tel-Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"School of Electrical Engineering , Tel-Aviv University , Tel-Aviv 69978 , 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":["School of Electrical Engineering, Tel Aviv University, Tel-Aviv, Israel","School of Electrical Engineering , Tel-Aviv University , Tel-Aviv 69978 , Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering, Tel Aviv University, Tel-Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"School of Electrical Engineering , Tel-Aviv University , Tel-Aviv 69978 , Israel","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":0.5659,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.59474438,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"2686","last_page":"2690"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"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":0.9998999834060669,"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/T12029","display_name":"DNA and Biological Computing","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9970999956130981,"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/tanner-graph","display_name":"Tanner graph","score":0.8554649353027344},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.8058044910430908},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7102382779121399},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6664620041847229},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5815702080726624},{"id":"https://openalex.org/keywords/certificate","display_name":"Certificate","score":0.5533699989318848},{"id":"https://openalex.org/keywords/parity-check-matrix","display_name":"Parity-check matrix","score":0.550715446472168},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5178842544555664},{"id":"https://openalex.org/keywords/girth","display_name":"Girth (graph theory)","score":0.46112698316574097},{"id":"https://openalex.org/keywords/characterization","display_name":"Characterization (materials science)","score":0.44077059626579285},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.42676809430122375},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.38900354504585266},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.33194929361343384},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2778274416923523},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.17614811658859253}],"concepts":[{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.8554649353027344},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.8058044910430908},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7102382779121399},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6664620041847229},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5815702080726624},{"id":"https://openalex.org/C96865113","wikidata":"https://www.wikidata.org/wiki/Q2946816","display_name":"Certificate","level":2,"score":0.5533699989318848},{"id":"https://openalex.org/C95925971","wikidata":"https://www.wikidata.org/wiki/Q3100414","display_name":"Parity-check matrix","level":4,"score":0.550715446472168},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5178842544555664},{"id":"https://openalex.org/C2777434295","wikidata":"https://www.wikidata.org/wiki/Q959831","display_name":"Girth (graph theory)","level":2,"score":0.46112698316574097},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.44077059626579285},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.42676809430122375},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.38900354504585266},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.33194929361343384},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2778274416923523},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.17614811658859253},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C171250308","wikidata":"https://www.wikidata.org/wiki/Q11468","display_name":"Nanotechnology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2012.6284007","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2012.6284007","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Symposium on Information Theory Proceedings","raw_type":"proceedings-article"}],"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/W7241855","https://openalex.org/W1537344883","https://openalex.org/W1588943481","https://openalex.org/W1970907073","https://openalex.org/W2019441424","https://openalex.org/W2033546746","https://openalex.org/W2067554595","https://openalex.org/W2087556581","https://openalex.org/W2103160098","https://openalex.org/W2133068391","https://openalex.org/W2169134868","https://openalex.org/W2176504112","https://openalex.org/W2952823298","https://openalex.org/W4302175014","https://openalex.org/W6632343532","https://openalex.org/W6635197353","https://openalex.org/W6642983288"],"related_works":["https://openalex.org/W3212819824","https://openalex.org/W3167562836","https://openalex.org/W4297803167","https://openalex.org/W4302175014","https://openalex.org/W2952823298","https://openalex.org/W2150639697","https://openalex.org/W2034577597","https://openalex.org/W4287029234","https://openalex.org/W2904381917","https://openalex.org/W2075723463"],"abstract_inverted_index":{"Given":[0],"a":[1,6,13,36,40,46,61,129],"channel":[2],"observation":[3],"y":[4],"and":[5,124,126,145],"codeword":[7,62],"x,":[8],"we":[9],"are":[10,53,106],"interested":[11],"in":[12,63,75,118,155,174],"one-sided":[14],"error":[15],"test":[16,37],"that":[17,52,116,128,168],"answers":[18],"the":[19,43,79,93,96,101,137,150,159,166,175,178],"questions:":[20],"is":[21,28,38,69,161],"x":[22],"optimal":[23],"with":[24],"respect":[25],"to":[26,109,141],"y?":[27],"it":[29],"unique?":[30],"A":[31],"positive":[32],"answer":[33],"for":[34,42,58],"such":[35],"called":[39],"certificate":[41,68,130],"optimality":[44],"of":[45,60,78,95,103,153,177],"codeword.":[47],"We":[48,114,135],"present":[49],"new":[50,120,138],"certificates":[51],"based":[54,70],"on":[55,71,149],"combinatorial":[56],"characterization":[57,121,140],"local-optimality":[59,117,139],"irregular":[64],"Tanner":[65,80,97,143,179],"codes.":[66],"The":[67],"weighted":[72],"normalized":[73],"trees":[74,77,83],"computation":[76],"graph.":[81,180],"These":[82],"may":[84],"have":[85],"any":[86],"finite":[87],"height":[88],"h":[89],"(even":[90],"greater":[91],"than":[92],"girth":[94,176],"graph).":[98],"In":[99],"addition,":[100],"degrees":[102],"local-code":[104],"nodes":[105],"not":[107],"restricted":[108],"two":[110],"(i.e.,":[111],"skinny":[112],"trees).":[113],"prove":[115,146],"this":[119],"implies":[122],"ML-optimality":[123],"LP-optimality,":[125],"show":[127],"can":[131],"be":[132],"computed":[133],"efficiently.":[134],"apply":[136],"regular":[142],"codes,":[144],"lower":[147,164],"bounds":[148],"noise":[151,160],"thresholds":[152],"LP-decoding":[154,169],"MBIOS":[156],"channels.":[157],"When":[158],"below":[162],"these":[163],"bounds,":[165],"probability":[167],"fails":[170],"decays":[171],"doubly":[172],"exponentially":[173]},"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}
