{"id":"https://openalex.org/W1981960903","doi":"https://doi.org/10.1109/isit.2013.6620776","title":"On the relevance of graph covers and zeta functions for the analysis of SPA decoding of cycle codes","display_name":"On the relevance of graph covers and zeta functions for the analysis of SPA decoding of cycle codes","publication_year":2013,"publication_date":"2013-07-01","ids":{"openalex":"https://openalex.org/W1981960903","doi":"https://doi.org/10.1109/isit.2013.6620776","mag":"1981960903"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2013.6620776","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2013.6620776","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 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/A5034044119","display_name":"Henry D. Pfister","orcid":"https://orcid.org/0000-0001-5521-4397"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Henry D. Pfister","raw_affiliation_strings":["Department of ECE, Texas A and M University, College Station, TX, USA","Dept. of ECE, Texas A&M Univ., College Station, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of ECE, Texas A and M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Dept. of ECE, Texas A&M Univ., College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","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":false,"raw_author_name":"Pascal O. Vontobel","raw_affiliation_strings":["Hewlett Packard Laboratories, Palo Alto, CA, USA","Hewlett\u2013Packard Laboratories, Palo Alto, CA, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hewlett Packard Laboratories, Palo Alto, CA, USA","institution_ids":["https://openalex.org/I1324840837"]},{"raw_affiliation_string":"Hewlett\u2013Packard Laboratories, Palo Alto, CA, USA#TAB#","institution_ids":["https://openalex.org/I1324840837"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7545,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.74122584,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"3000","last_page":"3004"},"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9836999773979187,"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.979200005531311,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6690648198127747},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6662181615829468},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.6527965068817139},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.6154887676239014},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.5687351226806641},{"id":"https://openalex.org/keywords/factor-graph","display_name":"Factor graph","score":0.5163711309432983},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.4671962261199951},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.4630140960216522},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44739970564842224},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.44102802872657776},{"id":"https://openalex.org/keywords/tanner-graph","display_name":"Tanner graph","score":0.42855802178382874},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31852614879608154},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.22133442759513855},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.18554189801216125},{"id":"https://openalex.org/keywords/error-floor","display_name":"Error floor","score":0.14369630813598633}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6690648198127747},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6662181615829468},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.6527965068817139},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.6154887676239014},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.5687351226806641},{"id":"https://openalex.org/C159246509","wikidata":"https://www.wikidata.org/wiki/Q5428725","display_name":"Factor graph","level":3,"score":0.5163711309432983},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.4671962261199951},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.4630140960216522},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44739970564842224},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44102802872657776},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.42855802178382874},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31852614879608154},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.22133442759513855},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.18554189801216125},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.14369630813598633}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2013.6620776","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2013.6620776","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6499999761581421,"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W7241855","https://openalex.org/W1484743436","https://openalex.org/W1523808012","https://openalex.org/W1536930200","https://openalex.org/W1588943481","https://openalex.org/W1625826026","https://openalex.org/W1969880716","https://openalex.org/W1974000719","https://openalex.org/W2035309551","https://openalex.org/W2049433041","https://openalex.org/W2088978568","https://openalex.org/W2110880184","https://openalex.org/W2137813581","https://openalex.org/W2139584447","https://openalex.org/W2150859678","https://openalex.org/W2155238182","https://openalex.org/W2167149929","https://openalex.org/W2568713596","https://openalex.org/W2761017552","https://openalex.org/W2963389401","https://openalex.org/W3105113057","https://openalex.org/W3106495992","https://openalex.org/W4213281018","https://openalex.org/W4251636534","https://openalex.org/W6629015709","https://openalex.org/W6635197353","https://openalex.org/W6676655017"],"related_works":["https://openalex.org/W2809536251","https://openalex.org/W2370284973","https://openalex.org/W2385322349","https://openalex.org/W2383267581","https://openalex.org/W2028976748","https://openalex.org/W2369600518","https://openalex.org/W2366145624","https://openalex.org/W1978153242","https://openalex.org/W2392775688","https://openalex.org/W2142440144"],"abstract_inverted_index":{"For":[0],"an":[1],"arbitrary":[2],"binary":[3],"cycle":[4,107,130],"code,":[5],"we":[6],"show":[7,50],"that":[8,51],"sum-product":[9,119],"algorithm":[10,122],"(SPA)":[11],"decoding":[12,105,123],"after":[13],"infinitely":[14],"many":[15],"iterations":[16],"equals":[17],"symbolwise":[18],"graph-cover":[19,93],"decoding.":[20],"We":[21,48],"do":[22],"this":[23,87],"by":[24,39,69],"characterizing":[25],"the":[26,32,46,52,60,64,70,75,81,90,101,115],"Bethe":[27],"free":[28],"energy":[29],"function":[30,78],"of":[31,45,54,72,74,92,103,106,117,124],"underlying":[33,82],"normal":[34],"factor":[35],"graph":[36],"(NFG)":[37],"and":[38,95,120],"stating":[40],"a":[41],"global":[42],"convergence":[43,73],"proof":[44],"SPA.":[47],"also":[49,112],"set":[53],"log-likelihood":[55],"ratio":[56],"vectors":[57],"for":[58,114],"which":[59],"SPA":[61,104],"converges":[62],"to":[63,99],"all-zero":[65],"codeword":[66],"is":[67],"given":[68],"region":[71],"edge":[76,96],"zeta":[77,97],"associated":[79],"with":[80],"NFG.":[83],"The":[84],"results":[85,110],"in":[86],"paper":[88],"justify":[89],"use":[91],"pseudo-codewords":[94],"functions":[98],"characterize":[100],"behavior":[102],"codes.":[108,131],"These":[109],"have":[111],"implications":[113],"analysis":[116],"attenuated":[118],"max-product":[121],"low-density":[125],"parity-check":[126],"(LDPC)":[127],"codes":[128],"beyond":[129]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}