{"id":"https://openalex.org/W2140250923","doi":"https://doi.org/10.1109/tit.2010.2048489","title":"A Separation Algorithm for Improved LP-Decoding of Linear Block Codes","display_name":"A Separation Algorithm for Improved LP-Decoding of Linear Block Codes","publication_year":2010,"publication_date":"2010-06-23","ids":{"openalex":"https://openalex.org/W2140250923","doi":"https://doi.org/10.1109/tit.2010.2048489","mag":"2140250923"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2010.2048489","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2010.2048489","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-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/A5081495032","display_name":"Ak\u0131n Tanatmis","orcid":null},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Akin Tanatmis","raw_affiliation_strings":["Department of Mathematics, University of Kaiserslautern, Kaiserslautern, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Kaiserslautern, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5107846021","display_name":"Stefan Ruzika","orcid":null},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Stefan Ruzika","raw_affiliation_strings":["Department of Mathematics, University of Kaiserslautern, Kaiserslautern, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Kaiserslautern, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111683448","display_name":"Horst W. Hamacher","orcid":null},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Horst W. Hamacher","raw_affiliation_strings":["Department of Mathematics, University of Kaiserslautern, Kaiserslautern, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Kaiserslautern, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060691866","display_name":"Mayur Punekar","orcid":null},"institutions":[{"id":"https://openalex.org/I100930933","display_name":"University College Dublin","ror":"https://ror.org/05m7pjf47","country_code":"IE","type":"education","lineage":["https://openalex.org/I100930933"]},{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]}],"countries":["DE","IE"],"is_corresponding":false,"raw_author_name":"Mayur Punekar","raw_affiliation_strings":["Department of Electronic and Electrical Engineering, University College Dublin, Dublin, Ireland","Microelectronic Systems Design Research Group, University of Kaiserslautern, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electronic and Electrical Engineering, University College Dublin, Dublin, Ireland","institution_ids":["https://openalex.org/I100930933"]},{"raw_affiliation_string":"Microelectronic Systems Design Research Group, University of Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042874331","display_name":"Frank Kienle","orcid":null},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Frank Kienle","raw_affiliation_strings":["Microelectronic Systems Design Research Group, University of Kaiserslautern, Kaiserslautern, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microelectronic Systems Design Research Group, University of Kaiserslautern, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059285190","display_name":"Norbert Wehn","orcid":"https://orcid.org/0000-0002-9010-086X"},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Norbert Wehn","raw_affiliation_strings":["Microelectronic Systems Design Research Group, University of Kaiserslautern, Kaiserslautern, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microelectronic Systems Design Research Group, University of Kaiserslautern, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":6,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.0842,"has_fulltext":false,"cited_by_count":47,"citation_normalized_percentile":{"value":0.97271303,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"56","issue":"7","first_page":"3277","last_page":"3289"},"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.9995999932289124,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.8454036712646484},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.7131636142730713},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.6741556525230408},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6476075649261475},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.6366673111915588},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.6272310018539429},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.6124520301818848},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.5527827739715576},{"id":"https://openalex.org/keywords/bch-code","display_name":"BCH code","score":0.5153557658195496},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.5122103095054626},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4971309006214142},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.43744704127311707},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.43294912576675415},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42877382040023804},{"id":"https://openalex.org/keywords/parity-check-matrix","display_name":"Parity-check matrix","score":0.4148217737674713},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.16211768984794617}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8454036712646484},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.7131636142730713},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.6741556525230408},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6476075649261475},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.6366673111915588},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6272310018539429},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.6124520301818848},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.5527827739715576},{"id":"https://openalex.org/C42276685","wikidata":"https://www.wikidata.org/wiki/Q795705","display_name":"BCH code","level":3,"score":0.5153557658195496},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.5122103095054626},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4971309006214142},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.43744704127311707},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.43294912576675415},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42877382040023804},{"id":"https://openalex.org/C95925971","wikidata":"https://www.wikidata.org/wiki/Q3100414","display_name":"Parity-check matrix","level":4,"score":0.4148217737674713},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.16211768984794617}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tit.2010.2048489","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2010.2048489","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.250.2537","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.250.2537","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/0812.2559v1.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5799999833106995,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320310969","display_name":"Technische Universit\u00e4t Kaiserslautern","ror":"https://ror.org/04zrf7b53"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W152471750","https://openalex.org/W193818406","https://openalex.org/W1538894044","https://openalex.org/W1592788572","https://openalex.org/W1652876111","https://openalex.org/W1655598735","https://openalex.org/W1875056259","https://openalex.org/W1963547452","https://openalex.org/W1968143987","https://openalex.org/W1969287452","https://openalex.org/W1993508000","https://openalex.org/W2018546375","https://openalex.org/W2035929826","https://openalex.org/W2078633872","https://openalex.org/W2097981865","https://openalex.org/W2104689908","https://openalex.org/W2113069364","https://openalex.org/W2158665129","https://openalex.org/W2163264905","https://openalex.org/W2169134868","https://openalex.org/W2170915934","https://openalex.org/W2570173562","https://openalex.org/W2949560198","https://openalex.org/W2952346284","https://openalex.org/W3143793205","https://openalex.org/W4206416237","https://openalex.org/W4233558979","https://openalex.org/W4285719527","https://openalex.org/W6606175091","https://openalex.org/W6607773459","https://openalex.org/W6632091454","https://openalex.org/W6636941251","https://openalex.org/W6637011549","https://openalex.org/W6639344520"],"related_works":["https://openalex.org/W4244153028","https://openalex.org/W2028976748","https://openalex.org/W2085052822","https://openalex.org/W2521769401","https://openalex.org/W2118148379","https://openalex.org/W4210406383","https://openalex.org/W2160839632","https://openalex.org/W4303471944","https://openalex.org/W2110262961","https://openalex.org/W2744658369"],"abstract_inverted_index":{"Maximum":[0],"likelihood":[1],"(ML)":[2],"decoding":[3,7,52,145],"is":[4,100,126],"the":[5,47,70,79,118],"optimal":[6,120],"algorithm":[8,44,139],"for":[9,53],"arbitrary":[10],"linear":[11,31,55],"block":[12,56],"codes":[13,131,135],"and":[14,29,81,115,132,146],"can":[15,107],"be":[16],"written":[17],"as":[18],"an":[19,60],"integer":[20],"programming":[21,32],"(IP)":[22],"problem.":[23],"Feldman":[24],"relaxed":[25],"this":[26,37],"IP":[27,61,80],"problem":[28],"presented":[30],"(LP)":[33],"based":[34],"decoding.":[35,124,150],"In":[36],"paper,":[38],"we":[39,106],"propose":[40],"a":[41],"new":[42],"separation":[43,86,138],"to":[45],"improve":[46],"error-correcting":[48],"performance":[49],"of":[50,91,122],"LP":[51,123,144],"binary":[54],"codes.":[57],"We":[58,74],"use":[59,82],"formulation":[62],"with":[63],"indicator":[64],"variables":[65],"that":[66,109,136],"help":[67],"in":[68,84],"detecting":[69],"violated":[71],"parity":[72,97],"checks.":[73],"derive":[75],"Gomory":[76],"cuts":[77,93,112],"from":[78],"them":[83],"our":[85,137],"algorithm.":[87],"An":[88],"efficient":[89],"method":[90],"finding":[92],"induced":[94],"by":[95],"redundant":[96],"checks":[98],"(RPC)":[99],"also":[101],"proposed.":[102],"Under":[103],"certain":[104],"circumstances":[105],"guarantee":[108],"these":[110],"RPC":[111],"are":[113],"valid":[114],"cut":[116],"off":[117],"fractional":[119],"solutions":[121],"It":[125],"demonstrated":[127],"on":[128],"three":[129],"LDPC":[130],"two":[133],"BCH":[134],"performs":[140],"significantly":[141],"better":[142],"than":[143],"belief":[147],"propagation":[148],"(BP)":[149]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":6}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}