{"id":"https://openalex.org/W2124713421","doi":"https://doi.org/10.1109/icc.2009.5199565","title":"Vertex Packing Decoding","display_name":"Vertex Packing Decoding","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2124713421","doi":"https://doi.org/10.1109/icc.2009.5199565","mag":"2124713421"},"language":"en","primary_location":{"id":"doi:10.1109/icc.2009.5199565","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2009.5199565","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Conference on Communications","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/A5036326134","display_name":"Michael Lunglmayr","orcid":"https://orcid.org/0000-0002-4014-9681"},"institutions":[{"id":"https://openalex.org/I134023368","display_name":"Institute for Interdisciplinary Studies of Austrian Universities","ror":"https://ror.org/001zf8v27","country_code":"AT","type":"education","lineage":["https://openalex.org/I134023368","https://openalex.org/I4210166741"]},{"id":"https://openalex.org/I4210166741","display_name":"University of Klagenfurt","ror":"https://ror.org/05q9m0937","country_code":"AT","type":"education","lineage":["https://openalex.org/I4210166741"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"M. Lunglmayr","raw_affiliation_strings":["Institute of Networked and Embedded Systems, Klagenfurt University, Klagenfurt, Austria","Klagenfurt University, Institute of Networked and Embedded Systems, Klagenfurt#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Networked and Embedded Systems, Klagenfurt University, Klagenfurt, Austria","institution_ids":["https://openalex.org/I4210166741"]},{"raw_affiliation_string":"Klagenfurt University, Institute of Networked and Embedded Systems, Klagenfurt#TAB#","institution_ids":["https://openalex.org/I134023368"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081754174","display_name":"Jens Berkmann","orcid":null},"institutions":[{"id":"https://openalex.org/I137594350","display_name":"Infineon Technologies (Germany)","ror":"https://ror.org/005kw6t15","country_code":"DE","type":"company","lineage":["https://openalex.org/I137594350"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"J. Berkmann","raw_affiliation_strings":["Infineon Technologies, Munich, Germany","INFINEON TECHNOLOGIES AG, Munich"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Infineon Technologies, Munich, Germany","institution_ids":["https://openalex.org/I137594350"]},{"raw_affiliation_string":"INFINEON TECHNOLOGIES AG, Munich","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049116697","display_name":"Mario Huemer","orcid":"https://orcid.org/0000-0002-3164-7232"},"institutions":[{"id":"https://openalex.org/I134023368","display_name":"Institute for Interdisciplinary Studies of Austrian Universities","ror":"https://ror.org/001zf8v27","country_code":"AT","type":"education","lineage":["https://openalex.org/I134023368","https://openalex.org/I4210166741"]},{"id":"https://openalex.org/I4210166741","display_name":"University of Klagenfurt","ror":"https://ror.org/05q9m0937","country_code":"AT","type":"education","lineage":["https://openalex.org/I4210166741"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"M. Huemer","raw_affiliation_strings":["Institute of Networked and Embedded Systems, Klagenfurt University, Klagenfurt, Austria","Klagenfurt University, Institute of Networked and Embedded Systems, Klagenfurt#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Networked and Embedded Systems, Klagenfurt University, Klagenfurt, Austria","institution_ids":["https://openalex.org/I4210166741"]},{"raw_affiliation_string":"Klagenfurt University, Institute of Networked and Embedded Systems, Klagenfurt#TAB#","institution_ids":["https://openalex.org/I134023368"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5406,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.59833853,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9993000030517578,"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"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9943000078201294,"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.8524451851844788},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.7085827589035034},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6072167754173279},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.5977344512939453},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5862281322479248},{"id":"https://openalex.org/keywords/belief-propagation","display_name":"Belief propagation","score":0.5556594133377075},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.55076003074646},{"id":"https://openalex.org/keywords/tanner-graph","display_name":"Tanner graph","score":0.545990526676178},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49566400051116943},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.48126906156539917},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47089439630508423},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.44829678535461426},{"id":"https://openalex.org/keywords/factor-graph","display_name":"Factor graph","score":0.4400763213634491},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41279250383377075},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.394375205039978},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2751358151435852},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.2619938552379608},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.23610061407089233},{"id":"https://openalex.org/keywords/error-floor","display_name":"Error floor","score":0.0972571074962616}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8524451851844788},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.7085827589035034},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6072167754173279},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.5977344512939453},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5862281322479248},{"id":"https://openalex.org/C152948882","wikidata":"https://www.wikidata.org/wiki/Q4060686","display_name":"Belief propagation","level":3,"score":0.5556594133377075},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.55076003074646},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.545990526676178},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49566400051116943},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.48126906156539917},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47089439630508423},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.44829678535461426},{"id":"https://openalex.org/C159246509","wikidata":"https://www.wikidata.org/wiki/Q5428725","display_name":"Factor graph","level":3,"score":0.4400763213634491},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41279250383377075},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.394375205039978},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2751358151435852},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.2619938552379608},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.23610061407089233},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.0972571074962616}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icc.2009.5199565","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2009.5199565","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Conference on Communications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.5899999737739563}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1508419498","https://openalex.org/W1535816011","https://openalex.org/W1548905833","https://openalex.org/W2013415302","https://openalex.org/W2033546746","https://openalex.org/W2082454406","https://openalex.org/W2082603400","https://openalex.org/W2119319086","https://openalex.org/W2128765501","https://openalex.org/W2137813581","https://openalex.org/W4214597316","https://openalex.org/W4234572373","https://openalex.org/W4300188436","https://openalex.org/W4301880801","https://openalex.org/W6658471458"],"related_works":["https://openalex.org/W4385859070","https://openalex.org/W4380030966","https://openalex.org/W26187695","https://openalex.org/W2153118538","https://openalex.org/W1493544699","https://openalex.org/W2127562763","https://openalex.org/W2366145624","https://openalex.org/W2118148379","https://openalex.org/W2135229457","https://openalex.org/W1978153242"],"abstract_inverted_index":{"In":[0],"this":[1,55],"work,":[2],"we":[3],"present":[4,47],"a":[5,18,38,43],"new":[6,19],"framework":[7],"for":[8,12,77],"developing":[9],"decoding":[10,32,51,76],"algorithms":[11,52,71],"linear":[13],"block":[14],"codes.":[15,83],"We":[16,46],"define":[17],"graphical":[20,56],"model,":[21],"called":[22],"configuration":[23,44],"graph":[24],"and":[25,58],"show":[26,59],"that":[27,60],"maximum":[28,39],"likelihood":[29],"(ML)":[30],"sequence":[31],"can":[33,64],"be":[34,65],"performed":[35],"by":[36,68],"finding":[37],"vertex":[40],"packing":[41],"on":[42],"graph.":[45],"examples":[48],"of":[49],"low-cost":[50],"developed":[53],"using":[54],"model":[57],"remarkable":[61],"performance":[62],"improvements":[63],"achieved":[66],"especially":[67],"combining":[69],"these":[70],"with":[72],"belief":[73],"propagation":[74],"(BP)":[75],"Low":[78],"Density":[79],"Parity":[80],"Check":[81],"(LDPC)":[82]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}