{"id":"https://openalex.org/W1808875461","doi":"https://doi.org/10.1109/isit.1995.550455","title":"Codes and iterative decoding on general graphs","display_name":"Codes and iterative decoding on general graphs","publication_year":2002,"publication_date":"2002-11-19","ids":{"openalex":"https://openalex.org/W1808875461","doi":"https://doi.org/10.1109/isit.1995.550455","mag":"1808875461"},"language":"en","primary_location":{"id":"doi:10.1109/isit.1995.550455","doi":"https://doi.org/10.1109/isit.1995.550455","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.1995.550455","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of 1995 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"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/A5013565266","display_name":"Niclas Wiberg","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"N. Wiberg","raw_affiliation_strings":["ISY, Link\u00f6ping University, Linkoping, Sweden","ISY, Link\u00f6ping University, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ISY, Link\u00f6ping University, Linkoping, Sweden","institution_ids":["https://openalex.org/I102134673"]},{"raw_affiliation_string":"ISY, Link\u00f6ping University, Sweden","institution_ids":["https://openalex.org/I102134673"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051479034","display_name":"Hans\u2010Andrea Loeliger","orcid":"https://orcid.org/0000-0001-7153-7145","observed_orcids":["https://orcid.org/0000-0001-7153-7145"]},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"H.-A. Loeliger","raw_affiliation_strings":["ISY, Link\u00f6ping University, Linkoping, Sweden","Department of Electrical Engineering, Link\u00f6ping University. S-581 83 Link\u00f6ping, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ISY, Link\u00f6ping University, Linkoping, Sweden","institution_ids":["https://openalex.org/I102134673"]},{"raw_affiliation_string":"Department of Electrical Engineering, Link\u00f6ping University. S-581 83 Link\u00f6ping, Sweden","institution_ids":["https://openalex.org/I102134673"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002792772","display_name":"Ralf K\u00f6tter","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"R. Kotter","raw_affiliation_strings":["ISY, Link\u00f6ping University, Linkoping, Sweden","Department of Electrical Engineering, Link\u00f6ping University. S-581 83 Link\u00f6ping, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ISY, Link\u00f6ping University, Linkoping, Sweden","institution_ids":["https://openalex.org/I102134673"]},{"raw_affiliation_string":"Department of Electrical Engineering, Link\u00f6ping University. S-581 83 Link\u00f6ping, Sweden","institution_ids":["https://openalex.org/I102134673"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I102134673"],"apc_list":null,"apc_paid":null,"fwci":7.2054,"has_fulltext":false,"cited_by_count":102,"citation_normalized_percentile":{"value":0.97622938,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"468","last_page":"468"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9994999766349792,"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.9994999766349792,"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.0005000000237487257,"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.9760000109672546},{"id":"https://openalex.org/keywords/tanner-graph","display_name":"Tanner graph","score":0.7519999742507935},{"id":"https://openalex.org/keywords/error-correcting-codes","display_name":"error-correcting codes","score":0.9269999861717224},{"id":"https://openalex.org/keywords/turbo-codes","display_name":"turbo codes","score":0.7590000033378601},{"id":"https://openalex.org/keywords/trellis-decoding","display_name":"trellis decoding","score":0.8709999918937683},{"id":"https://openalex.org/keywords/viterbi-decoding","display_name":"Viterbi decoding","score":0.7889999747276306},{"id":"https://openalex.org/keywords/code-representation","display_name":"code representation","score":0.35100001096725464}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6965779066085815},{"id":"https://openalex.org/C113638808","wikidata":"https://www.wikidata.org/wiki/Q6094410","display_name":"Iterative Viterbi decoding","level":5,"score":0.6806914806365967},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.673641562461853},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.6636040210723877},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.6625118255615234},{"id":"https://openalex.org/C60582962","wikidata":"https://www.wikidata.org/wiki/Q83886","display_name":"Viterbi algorithm","level":3,"score":0.5938296318054199},{"id":"https://openalex.org/C2781235587","wikidata":"https://www.wikidata.org/wiki/Q7838009","display_name":"Trellis (graph)","level":3,"score":0.5630037784576416},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5550158023834229},{"id":"https://openalex.org/C117379686","wikidata":"https://www.wikidata.org/wiki/Q6996459","display_name":"Viterbi decoder","level":3,"score":0.552202045917511},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5478009581565857},{"id":"https://openalex.org/C159246509","wikidata":"https://www.wikidata.org/wiki/Q5428725","display_name":"Factor graph","level":3,"score":0.5400488972663879},{"id":"https://openalex.org/C157899210","wikidata":"https://www.wikidata.org/wiki/Q1395022","display_name":"Convolutional code","level":3,"score":0.4823269546031952},{"id":"https://openalex.org/C5546382","wikidata":"https://www.wikidata.org/wiki/Q7572755","display_name":"Space\u2013time trellis code","level":5,"score":0.4790678918361664},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.46873363852500916},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46567341685295105},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.45258861780166626},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.4237542152404785},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.39838358759880066},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36841702461242676},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3018897771835327}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.1995.550455","doi":"https://doi.org/10.1109/isit.1995.550455","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.1995.550455","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of 1995 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1562979145","https://openalex.org/W2045407304","https://openalex.org/W2121606987","https://openalex.org/W2128765501","https://openalex.org/W2133068391"],"related_works":["https://openalex.org/W7241855","https://openalex.org/W1976246211","https://openalex.org/W2271098204","https://openalex.org/W7095123288","https://openalex.org/W2141069380","https://openalex.org/W7096935550","https://openalex.org/W34390032","https://openalex.org/W7220791770","https://openalex.org/W7096388975","https://openalex.org/W2942100575"],"abstract_inverted_index":{"Until":[0],"recently,":[1],"most":[2,52],"known":[3],"decoding":[4,35],"procedures":[5],"for":[6],"error-correcting":[7],"codes":[8],"were":[9],"based":[10],"either":[11],"on":[12,19],"algebraically":[13],"calculating":[14],"the":[15,28,65,75,101],"error":[16],"pattern":[17],"or":[18,24],"some":[20],"sort":[21],"of":[22,30,57,64,78,85,104],"tree":[23],"trellis":[25,59,106],"search.":[26],"With":[27,44],"advent":[29],"turbo":[31],"coding,":[32],"a":[33,49,58,80,86,94,105,111],"third":[34],"principle":[36],"has":[37],"finally":[38],"had":[39],"its":[40],"breakthrough:":[41],"iterative":[42,73],"decoding.":[43],"respect":[45,71],"to":[46,72,110],"Viterbi":[47],"decoding,":[48,74],"code":[50,81],"is":[51,68,82,100,108],"naturally":[53],"described":[54],"by":[55,83],"means":[56,84],"diagram.":[60],"The":[61],"main":[62],"thesis":[63],"present":[66],"paper":[67],"that,":[69],"with":[70],"natural":[76],"way":[77],"describing":[79],"Tanner":[87,112],"graph,":[88],"which":[89],"may":[90],"be":[91],"viewed":[92],"as":[93],"generalized":[95,109],"trellis.":[96],"More":[97],"precisely,":[98],"it":[99],"\"time":[102],"axis\"":[103],"that":[107],"graph.":[113]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-11-10T11:39:43.021295","created_date":"2016-06-24T00:00:00"}