{"id":"https://openalex.org/W2109454961","doi":"https://doi.org/10.1109/allerton.2008.4797727","title":"Symbolwise graph-cover decoding: Connecting sum-product algorithm decoding and bethe free energy minimization","display_name":"Symbolwise graph-cover decoding: Connecting sum-product algorithm decoding and bethe free energy minimization","publication_year":2008,"publication_date":"2008-09-01","ids":{"openalex":"https://openalex.org/W2109454961","doi":"https://doi.org/10.1109/allerton.2008.4797727","mag":"2109454961"},"language":"en","primary_location":{"id":"doi:10.1109/allerton.2008.4797727","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2008.4797727","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","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/A5028154201","display_name":"Pascal O. Vontobel","orcid":"https://orcid.org/0000-0002-6180-258X"},"institutions":[{"id":"https://openalex.org/I1324840837","display_name":"Hewlett-Packard (United States)","ror":"https://ror.org/059rn9488","country_code":"US","type":"company","lineage":["https://openalex.org/I1324840837"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Pascal O. Vontobel","raw_affiliation_strings":["Hewlett Packard Laboratories, Palo Alto, CA, USA","Hewlett-Packard Laboratories, Palo Alto. Ca#TAB#"],"affiliations":[{"raw_affiliation_string":"Hewlett Packard Laboratories, Palo Alto, CA, USA","institution_ids":["https://openalex.org/I1324840837"]},{"raw_affiliation_string":"Hewlett-Packard Laboratories, Palo Alto. Ca#TAB#","institution_ids":["https://openalex.org/I1324840837"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5028154201"],"corresponding_institution_ids":["https://openalex.org/I1324840837"],"apc_list":null,"apc_paid":null,"fwci":1.833,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.87074049,"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":"1416","last_page":"1416"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9925000071525574,"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.9925000071525574,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9674000144004822,"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.960099995136261,"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/decoding-methods","display_name":"Decoding methods","score":0.8534198999404907},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.7150048017501831},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.5942054390907288},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5669803619384766},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.5419841408729553},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5001721382141113},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49994754791259766},{"id":"https://openalex.org/keywords/product","display_name":"Product (mathematics)","score":0.4591789245605469},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.45400333404541016},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44904765486717224},{"id":"https://openalex.org/keywords/factor-graph","display_name":"Factor graph","score":0.4318874478340149},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37682241201400757},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3409956991672516},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3394950032234192},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.12163165211677551},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.09369400143623352}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8534198999404907},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.7150048017501831},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.5942054390907288},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5669803619384766},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.5419841408729553},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5001721382141113},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49994754791259766},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.4591789245605469},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.45400333404541016},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44904765486717224},{"id":"https://openalex.org/C159246509","wikidata":"https://www.wikidata.org/wiki/Q5428725","display_name":"Factor graph","level":3,"score":0.4318874478340149},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37682241201400757},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3409956991672516},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3394950032234192},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.12163165211677551},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.09369400143623352},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/allerton.2008.4797727","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2008.4797727","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7","score":0.8700000047683716}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2385322349","https://openalex.org/W2369600518","https://openalex.org/W2370284973","https://openalex.org/W2028976748","https://openalex.org/W2050784748","https://openalex.org/W2383267581","https://openalex.org/W2102627024","https://openalex.org/W2182594114","https://openalex.org/W2085052822","https://openalex.org/W2357077655"],"abstract_inverted_index":{"In":[0,38,107],"the":[1,28,55,72,75,81,84,123,129,137,142,152,157,162],"past,":[2],"graph-cover":[3,8,44],"decoding,":[4,23],"here":[5],"called":[6],"blockwise":[7],"decoding":[9,33,45,60],"(B-GCD),":[10],"has":[11],"been":[12],"introduced":[13],"as":[14],"a":[15,47,68,88,111,115],"theoretical":[16,48],"tool":[17,49],"to":[18,25,52,93,133],"better":[19,26,53],"understand":[20,27,54],"message-passing":[21],"iterative":[22],"especially":[24],"connections":[29,56],"between":[30,57],"max-product":[31],"algorithm":[32,59,105,131],"and":[34,61,79,95,120,155],"linear":[35],"programming":[36],"decoding.":[37,106],"this":[39],"paper":[40],"we":[41],"introduce":[42],"symbolwise":[43],"(S-GCD),":[46],"that":[50,125],"helps":[51],"sum-product":[58,104,130],"Bethe":[62,76,85,138],"free":[63,77,86,139],"energy":[64,78],"minimization.":[65],"S-GCD":[66],"motivates":[67],"deeper":[69],"study":[70,89],"of":[71,74,80,83,114,128,136,141,145,148,151,156,161,167],"properties":[73],"pseudo-dual":[82],"energy,":[87],"which":[90],"allows":[91],"one":[92],"re-derive":[94],"shed":[96],"new":[97,112],"light":[98],"on":[99],"many":[100],"known":[101],"results":[102],"for":[103],"particular,":[108],"it":[109],"gives":[110],"interpretation":[113],"result":[116,124],"by":[117],"Yedidia,":[118],"Freeman,":[119],"Weiss":[121],"(namely":[122],"fixed":[126],"points":[127,135],"correspond":[132],"stationary":[134],"energy),":[140],"fundamental":[143],"polytope,":[144],"stopping":[146],"sets,":[147],"EXIT":[149],"charts,":[150],"Maxwell":[153],"construction/decoder,":[154],"asymptotic":[158],"growth":[159],"rate":[160],"average":[163],"Hamming":[164],"weight":[165],"distribution":[166],"certain":[168],"(protograph)":[169],"code":[170],"ensembles.":[171]},"counts_by_year":[{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}