{"id":"https://openalex.org/W2963745009","doi":"https://doi.org/10.1109/istc.2012.6325228","title":"Local-optimality guarantees for optimal decoding based on paths","display_name":"Local-optimality guarantees for optimal decoding based on paths","publication_year":2012,"publication_date":"2012-08-01","ids":{"openalex":"https://openalex.org/W2963745009","doi":"https://doi.org/10.1109/istc.2012.6325228","mag":"2963745009"},"language":"en","primary_location":{"id":"doi:10.1109/istc.2012.6325228","is_oa":false,"landing_page_url":"https://doi.org/10.1109/istc.2012.6325228","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)","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"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering, Tel Aviv University, 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":["School of Electrical Engineering, Tel Aviv University, Tel-Aviv, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering, Tel Aviv University, Tel-Aviv, 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.283,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.54128337,"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":"205","last_page":"209"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9993000030517578,"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.9993000030517578,"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/T11130","display_name":"Coding theory and cryptography","score":0.9984999895095825,"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"}},{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9958000183105469,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.8122174739837646},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.791822612285614},{"id":"https://openalex.org/keywords/tanner-graph","display_name":"Tanner graph","score":0.7501835227012634},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5252299308776855},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.47836440801620483},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4322400987148285},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.43087825179100037},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4031028151512146},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.39878594875335693},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3822159767150879},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.22816306352615356},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.16664335131645203}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8122174739837646},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.791822612285614},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.7501835227012634},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5252299308776855},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.47836440801620483},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4322400987148285},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.43087825179100037},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4031028151512146},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39878594875335693},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3822159767150879},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.22816306352615356},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.16664335131645203},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/istc.2012.6325228","is_oa":false,"landing_page_url":"https://doi.org/10.1109/istc.2012.6325228","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)","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/W2019441424","https://openalex.org/W2033546746","https://openalex.org/W2067554595","https://openalex.org/W2087556581","https://openalex.org/W2114364830","https://openalex.org/W2169134868","https://openalex.org/W2175308498","https://openalex.org/W2176504112","https://openalex.org/W2963745009","https://openalex.org/W4205661203","https://openalex.org/W4300188436","https://openalex.org/W4302175014","https://openalex.org/W6632343532","https://openalex.org/W6635197353"],"related_works":["https://openalex.org/W2809536251","https://openalex.org/W2125154953","https://openalex.org/W2140459655","https://openalex.org/W2521082822","https://openalex.org/W2090054304","https://openalex.org/W98604564","https://openalex.org/W2034577597","https://openalex.org/W4302175014","https://openalex.org/W2354117331","https://openalex.org/W2952823298"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,72,101],"unified":[4],"analysis":[5],"framework":[6],"that":[7,77],"captures":[8],"recent":[9],"advances":[10],"in":[11,30,85,109],"the":[12,31,35,58,81,95,110,116],"study":[13],"of":[14,34,74,90,97,103,120,125],"local-optimality":[15,22],"characterizations":[16,23],"for":[17,122],"codes":[18],"on":[19,26,80,115],"graphs.":[20],"These":[21],"are":[24,113],"based":[25,79],"combinatorial":[27,83],"structures":[28,84],"embedded":[29],"Tanner":[32,86,104,126],"graph":[33],"code.":[36],"Local-optimality":[37],"implies":[38],"both":[39],"maximum-likelihood":[40],"(ML)":[41],"optimality":[42,76,99],"and":[43],"linear-programming":[44],"(LP)":[45],"decoding":[46,52],"optimality.":[47],"Also,":[48],"an":[49],"iterative":[50],"message-passing":[51],"algorithm":[53],"is":[54,78],"guaranteed":[55],"to":[56,100],"find":[57],"unique":[59],"locally-optimal":[60],"codeword,":[61],"if":[62],"one":[63],"exists.":[64],"We":[65,93],"demonstrate":[66],"this":[67,123],"proof":[68],"technique":[69,96],"by":[70],"considering":[71],"definition":[73],"local":[75,98],"simplest":[82],"graphs,":[87],"namely,":[88],"paths":[89],"length":[91,112],"h.":[92],"apply":[94],"family":[102,124],"codes.":[105,127],"Inverse":[106],"polynomial":[107],"bounds":[108],"code":[111],"proved":[114],"word":[117],"error":[118],"probability":[119],"LP-decoding":[121]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}