{"id":"https://openalex.org/W2072753720","doi":"https://doi.org/10.1109/isit.2013.6620475","title":"Towards combinatorial LP turbo decoding","display_name":"Towards combinatorial LP turbo decoding","publication_year":2013,"publication_date":"2013-07-01","ids":{"openalex":"https://openalex.org/W2072753720","doi":"https://doi.org/10.1109/isit.2013.6620475","mag":"2072753720"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2013.6620475","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2013.6620475","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":"preprint","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1301.6363","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5001833921","display_name":"Michael Helmling","orcid":"https://orcid.org/0000-0002-9133-7076"},"institutions":[{"id":"https://openalex.org/I2802076133","display_name":"University of Koblenz and Landau","ror":"https://ror.org/01j9f6752","country_code":"DE","type":"education","lineage":["https://openalex.org/I2802076133"]},{"id":"https://openalex.org/I4387153937","display_name":"Universit\u00e4t Koblenz","ror":"https://ror.org/0433e6t24","country_code":null,"type":"education","lineage":["https://openalex.org/I4387153937"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Michael Helmling","raw_affiliation_strings":["Mathematical Institute, University of Koblenz-Landau, Koblenz, Germany","Math. Inst., Univ. of Koblenz-Landau, Koblenz, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mathematical Institute, University of Koblenz-Landau, Koblenz, Germany","institution_ids":["https://openalex.org/I2802076133","https://openalex.org/I4387153937"]},{"raw_affiliation_string":"Math. Inst., Univ. of Koblenz-Landau, Koblenz, Germany","institution_ids":["https://openalex.org/I2802076133","https://openalex.org/I4387153937"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5107846021","display_name":"Stefan Ruzika","orcid":null},"institutions":[{"id":"https://openalex.org/I2802076133","display_name":"University of Koblenz and Landau","ror":"https://ror.org/01j9f6752","country_code":"DE","type":"education","lineage":["https://openalex.org/I2802076133"]},{"id":"https://openalex.org/I4387153937","display_name":"Universit\u00e4t Koblenz","ror":"https://ror.org/0433e6t24","country_code":null,"type":"education","lineage":["https://openalex.org/I4387153937"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Stefan Ruzika","raw_affiliation_strings":["Mathematical Institute, University of Koblenz-Landau, Koblenz, Germany","Math. Inst., Univ. of Koblenz-Landau, Koblenz, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mathematical Institute, University of Koblenz-Landau, Koblenz, Germany","institution_ids":["https://openalex.org/I2802076133","https://openalex.org/I4387153937"]},{"raw_affiliation_string":"Math. Inst., Univ. of Koblenz-Landau, Koblenz, Germany","institution_ids":["https://openalex.org/I2802076133","https://openalex.org/I4387153937"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2349,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.6160574,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1491","last_page":"1495"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9998000264167786,"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.9995999932289124,"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"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9993000030517578,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6574513912200928},{"id":"https://openalex.org/keywords/factor-graph","display_name":"Factor graph","score":0.6336053013801575},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.6206067800521851},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.592670738697052},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5735090374946594},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5217514634132385},{"id":"https://openalex.org/keywords/turbo","display_name":"Turbo","score":0.4975636303424835},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4936445951461792},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4778718054294586},{"id":"https://openalex.org/keywords/tanner-graph","display_name":"Tanner graph","score":0.4708309471607208},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4477512836456299},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.42564883828163147},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.4198451638221741},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41708481311798096},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.3895190954208374},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10447213053703308},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.10375523567199707}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6574513912200928},{"id":"https://openalex.org/C159246509","wikidata":"https://www.wikidata.org/wiki/Q5428725","display_name":"Factor graph","level":3,"score":0.6336053013801575},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.6206067800521851},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.592670738697052},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5735090374946594},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5217514634132385},{"id":"https://openalex.org/C2776240298","wikidata":"https://www.wikidata.org/wiki/Q1138513","display_name":"Turbo","level":2,"score":0.4975636303424835},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4936445951461792},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4778718054294586},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.4708309471607208},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4477512836456299},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42564883828163147},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.4198451638221741},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41708481311798096},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.3895190954208374},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10447213053703308},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.10375523567199707},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C171146098","wikidata":"https://www.wikidata.org/wiki/Q124192","display_name":"Automotive engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2013.6620475","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2013.6620475","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"},{"id":"pmh:oai:arXiv.org:1301.6363","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1301.6363","pdf_url":"https://arxiv.org/pdf/1301.6363","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1301.6363","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1301.6363","pdf_url":"https://arxiv.org/pdf/1301.6363","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1970755778","https://openalex.org/W1992586477","https://openalex.org/W2033546746","https://openalex.org/W2035929826","https://openalex.org/W2079180764","https://openalex.org/W2120606723","https://openalex.org/W2121606987","https://openalex.org/W2398456452","https://openalex.org/W2505968561","https://openalex.org/W2987657883","https://openalex.org/W3102722622","https://openalex.org/W3105799065","https://openalex.org/W4301808069"],"related_works":["https://openalex.org/W2139745099","https://openalex.org/W2127950068","https://openalex.org/W2015101254","https://openalex.org/W1782566311","https://openalex.org/W2114468163","https://openalex.org/W2132566027","https://openalex.org/W1989608637","https://openalex.org/W1968988046","https://openalex.org/W2373473769","https://openalex.org/W2105694638"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,14,78],"novel":[3],"algorithm":[4,70],"that":[5,68],"solves":[6],"the":[7,33,37,44,73],"turbo":[8,38],"code":[9],"LP":[10,85],"decoding":[11],"problem":[12],"in":[13,24,32],"finite":[15,62],"number":[16],"of":[17,55,80,82],"steps":[18],"by":[19],"Euclidean":[20],"distance":[21],"minimizations,":[22],"which":[23,52],"turn":[25],"rely":[26],"on":[27],"repeated":[28],"shortest":[29],"path":[30],"computations":[31],"trellis":[34],"graph":[35,46],"representing":[36],"code.":[39],"Previous":[40],"attempts":[41],"to":[42,50,77],"exploit":[43],"combinatorial":[45],"structure":[47],"only":[48],"led":[49],"algorithms":[51],"are":[53],"either":[54],"heuristic":[56],"nature":[57],"or":[58],"do":[59],"not":[60],"guarantee":[61],"convergence.":[63],"A":[64],"numerical":[65],"study":[66],"shows":[67],"our":[69],"clearly":[71],"beats":[72],"running":[74],"time,":[75],"up":[76],"factor":[79],"100,":[81],"generic":[83],"commercial":[84],"solvers":[86],"for":[87,91],"medium-sized":[88],"codes,":[89],"especially":[90],"high":[92],"SNR":[93],"values.":[94]},"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-03T08:13:44.112507","created_date":"2016-06-24T00:00:00"}