{"id":"https://openalex.org/W7241855","doi":null,"title":"Codes and Decoding on General Graphs","display_name":"Codes and Decoding on General Graphs","publication_year":1996,"publication_date":"1996-01-01","ids":{"openalex":"https://openalex.org/W7241855","mag":"7241855"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.24.6027","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.6027","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.it.isy.liu.se/publikationer/LIU-TEK-THESIS-440.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5013565266","display_name":"Niclas Wiberg","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"N. Wiberg","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5013565266"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":9.8912,"has_fulltext":false,"cited_by_count":869,"citation_normalized_percentile":{"value":0.97812668,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":93,"max":100},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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/T11130","display_name":"Coding theory and cryptography","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.0,"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/iterative-decoding","display_name":"iterative decoding","score":0.9819999933242798},{"id":"https://openalex.org/keywords/min-sum-algorithm","display_name":"min-sum algorithm","score":0.7260000109672546},{"id":"https://openalex.org/keywords/sum-product-algorithm","display_name":"sum-product algorithm","score":1.0},{"id":"https://openalex.org/keywords/viterbi-decoding","display_name":"Viterbi decoding","score":0.8700000047683716},{"id":"https://openalex.org/keywords/tanner-graph","display_name":"Tanner graph","score":0.5899999737739563},{"id":"https://openalex.org/keywords/turbo-codes","display_name":"turbo codes","score":0.8040000200271606},{"id":"https://openalex.org/keywords/cycle-free-graphs","display_name":"cycle-free graphs","score":0.6140000224113464},{"id":"https://openalex.org/keywords/maximum-likelihood-decoding","display_name":"maximum likelihood decoding","score":0.7919999957084656},{"id":"https://openalex.org/keywords/decoding-complexity","display_name":"decoding complexity","score":0.7360000014305115},{"id":"https://openalex.org/keywords/union-bound","display_name":"union bound","score":0.875},{"id":"https://openalex.org/keywords/uncorrectable-errors","display_name":"uncorrectable errors","score":0.8529999852180481},{"id":"https://openalex.org/keywords/error-performance-analysis","display_name":"error performance analysis","score":0.35199999809265137}],"concepts":[{"id":"https://openalex.org/C113638808","wikidata":"https://www.wikidata.org/wiki/Q6094410","display_name":"Iterative Viterbi decoding","level":5,"score":0.8168615102767944},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.81467205286026},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.7101279497146606},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6861491203308105},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6230055689811707},{"id":"https://openalex.org/C117379686","wikidata":"https://www.wikidata.org/wiki/Q6996459","display_name":"Viterbi decoder","level":3,"score":0.6225720643997192},{"id":"https://openalex.org/C60582962","wikidata":"https://www.wikidata.org/wiki/Q83886","display_name":"Viterbi algorithm","level":3,"score":0.6081632375717163},{"id":"https://openalex.org/C159246509","wikidata":"https://www.wikidata.org/wiki/Q5428725","display_name":"Factor graph","level":3,"score":0.5992261171340942},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5461124777793884},{"id":"https://openalex.org/C130319729","wikidata":"https://www.wikidata.org/wiki/Q83886","display_name":"Soft output Viterbi algorithm","level":5,"score":0.5370005965232849},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.5159483551979065},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.4604658782482147},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.43387371301651},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.43222954869270325},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37238866090774536},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3416803181171417},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.23614344000816345},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.19950011372566223}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.24.6027","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.6027","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.it.isy.liu.se/publikationer/LIU-TEK-THESIS-440.pdf","raw_type":"text"},{"id":"mag:7241855","doi":null,"is_oa":false,"landing_page_url":"https://www.csie.ntu.edu.tw/~r92049/Files/LIU-TEK-THESIS-440.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W63990713","https://openalex.org/W1503161078","https://openalex.org/W1511161134","https://openalex.org/W1562979145","https://openalex.org/W1567885833","https://openalex.org/W1606480398","https://openalex.org/W1920254817","https://openalex.org/W2005457258","https://openalex.org/W2053913299","https://openalex.org/W2079808112","https://openalex.org/W2083394863","https://openalex.org/W2097117337","https://openalex.org/W2099111195","https://openalex.org/W2119411189","https://openalex.org/W2121606987","https://openalex.org/W2126519187","https://openalex.org/W2128765501","https://openalex.org/W2133068391","https://openalex.org/W2134602399","https://openalex.org/W2137347071","https://openalex.org/W2138033161","https://openalex.org/W2141564812","https://openalex.org/W2142384583","https://openalex.org/W2142511915","https://openalex.org/W2158927130","https://openalex.org/W2160668024","https://openalex.org/W2168226105"],"related_works":["https://openalex.org/W1808875461","https://openalex.org/W34390032","https://openalex.org/W34792075","https://openalex.org/W2271098204","https://openalex.org/W7095123288","https://openalex.org/W7096388975","https://openalex.org/W1493544699","https://openalex.org/W1976246211","https://openalex.org/W7095337363","https://openalex.org/W2143957155"],"abstract_inverted_index":{"Iterative":[0,114],"decoding":[1,42,100,115,149,162,174],"techniques":[2],"have":[3],"become":[4],"a":[5,153,164],"viable":[6],"alternative":[7],"for":[8,147],"constructing":[9],"high":[10],"performance":[11,24,145],"coding":[12],"systems.":[13],"In":[14,33],"particular,":[15],"the":[16,27,51,79,83,91,98,118,126,141,156],"recent":[17],"success":[18],"of":[19,47,82,155,166],"turbo":[20,124],"codes":[21],"indicates":[22],"that":[23,39,168],"close":[25],"to":[26,140],"Shannon":[28],"limit":[29],"may":[30],"be":[31],"achieved.":[32],"this":[34],"thesis,":[35],"it":[36],"is":[37,85],"showed":[38],"many":[40,173],"iterative":[41,148],"algorithms":[43,60,69,101,128],"are":[44,70,105,129,137,150,169],"special":[45],"cases":[46],"two":[48],"generic":[49],"algorithms,":[50,55,77],"min-sum":[52,66],"and":[53,67,72,163],"sum-product":[54,68],"which":[56],"also":[57],"include":[58],"non-iterative":[59],"such":[61],"as":[62,74],"Viterbi":[63,103,161],"decoding.":[64],"The":[65],"developed":[71],"presented":[73],"generalized":[75],"trellis":[76,84],"where":[78],"time":[80],"axis":[81],"replaced":[86],"by":[87],"an":[88,110],"arbitrary":[89],"graph,":[90],"\"Tanner":[92],"graph\".":[93],"With":[94],"cycle-free":[95,142],"Tanner":[96,119],"graphs,":[97],"resulting":[99,127],"(e.g.,":[102,123],"decoding)":[104],"maximum-likelihood":[106],"but":[107,133],"suffer":[108],"from":[109],"exponentially":[111],"increasing":[112],"complexity.":[113],"occurs":[116],"when":[117],"graph":[120],"has":[121],"cycles":[122],"codes);":[125],"in":[130],"general":[131],"suboptimal,":[132],"significant":[134],"complexity":[135],"reductions":[136],"possible":[138],"compared":[139],"case.":[143],"Several":[144],"estimates":[146],"developed,":[151],"including":[152],"generalization":[154],"union":[157],"bound":[158],"used":[159],"with":[160],"characterization":[165],"errors":[167],"uncorrectable":[170],"after":[171],"infinitely":[172],"iterations.":[175]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":14},{"year":2017,"cited_by_count":13},{"year":2016,"cited_by_count":20},{"year":2015,"cited_by_count":22},{"year":2014,"cited_by_count":28},{"year":2013,"cited_by_count":42},{"year":2012,"cited_by_count":64}],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2016-06-24T00:00:00"}