{"id":"https://openalex.org/W1644601915","doi":"https://doi.org/10.1109/tit.2012.2204955","title":"Adaptive Cut Generation Algorithm for Improved Linear Programming Decoding of Binary Linear Codes","display_name":"Adaptive Cut Generation Algorithm for Improved Linear Programming Decoding of Binary Linear Codes","publication_year":2012,"publication_date":"2012-06-16","ids":{"openalex":"https://openalex.org/W1644601915","doi":"https://doi.org/10.1109/tit.2012.2204955","mag":"1644601915"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2012.2204955","doi":"https://doi.org/10.1109/tit.2012.2204955","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2012.2204955","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,"listed_in":["anvur-class-a","anvur-scientific","ccf-a","cwts-core","dongbi-a","jufo-3","norway-2","poland-200","russia-white-list-1"],"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"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1105.0703","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100718556","display_name":"Xiaojie Zhang","orcid":"https://orcid.org/0009-0005-6576-1876","observed_orcids":["https://orcid.org/0009-0005-6576-1876","https://orcid.org/0009-0000-9439-4626"]},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xiaojie Zhang","raw_affiliation_strings":["Department of Electrical and Computer Engineering and the Center for Magnetic Recording Research, University of California, San Diego, La Jolla, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering and the Center for Magnetic Recording Research, University of California, San Diego, La Jolla, CA, USA","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060049531","display_name":"Paul H. Siegel","orcid":"https://orcid.org/0000-0001-5850-0874","observed_orcids":["https://orcid.org/0000-0001-5850-0874"]},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Paul H. Siegel","raw_affiliation_strings":["Department of Electrical and Computer Engineering and the Center for Magnetic Recording Research, University of California, San Diego, La Jolla, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering and the Center for Magnetic Recording Research, University of California, San Diego, La Jolla, CA, USA","institution_ids":["https://openalex.org/I36258959"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I36258959"],"apc_list":{"value":2645,"currency":"USD","value_usd":2645},"apc_paid":null,"fwci":8.4237,"has_fulltext":true,"cited_by_count":66,"citation_normalized_percentile":{"value":0.97729407,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":87,"max":99},"biblio":{"volume":"58","issue":"10","first_page":"6581","last_page":"6594"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9984999895095825,"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.9984999895095825,"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.0008999999845400453,"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.00019999999494757503,"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/linear-programming-decoding","display_name":"linear programming decoding","score":0.972000002861023},{"id":"https://openalex.org/keywords/binary-linear-codes","display_name":"binary linear codes","score":0.9039999842643738},{"id":"https://openalex.org/keywords/cut-generation","display_name":"cut generation","score":0.8379999995231628},{"id":"https://openalex.org/keywords/pseudocodewords","display_name":"pseudocodewords","score":0.9010000228881836},{"id":"https://openalex.org/keywords/maximum-likelihood-decoding","display_name":"maximum likelihood decoding","score":0.8130000233650208},{"id":"https://openalex.org/keywords/low-density-parity-check-codes","display_name":"LDPC codes","score":0.8159999847412109},{"id":"https://openalex.org/keywords/error-rate-performance","display_name":"error rate performance","score":0.5929999947547913}],"concepts":[{"id":"https://openalex.org/C95925971","wikidata":"https://www.wikidata.org/wiki/Q3100414","display_name":"Parity-check matrix","level":4,"score":0.7800999879837036},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7646999955177307},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.7210000157356262},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.697700023651123},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5601000189781189},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.507099986076355},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.491100013256073},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4546999931335449},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.4361000061035156},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.423799991607666},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.4196999967098236},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4171000123023987},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.413100004196167},{"id":"https://openalex.org/C131521367","wikidata":"https://www.wikidata.org/wiki/Q625502","display_name":"Parity bit","level":2,"score":0.4056999981403351},{"id":"https://openalex.org/C84135550","wikidata":"https://www.wikidata.org/wiki/Q3154022","display_name":"Linear inequality","level":3,"score":0.4023999869823456},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.40070000290870667},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3725000023841858},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.3684000074863434},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.33970001339912415},{"id":"https://openalex.org/C204241405","wikidata":"https://www.wikidata.org/wiki/Q461499","display_name":"Transformation (genetics)","level":3,"score":0.31769999861717224},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.31540000438690186},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.3082999885082245},{"id":"https://openalex.org/C52486349","wikidata":"https://www.wikidata.org/wiki/Q17006040","display_name":"Criss-cross algorithm","level":4,"score":0.3057999908924103},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.299699991941452},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.29010000824928284},{"id":"https://openalex.org/C6802819","wikidata":"https://www.wikidata.org/wiki/Q1072174","display_name":"Linear system","level":2,"score":0.2879999876022339},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.2793000042438507},{"id":"https://openalex.org/C39635130","wikidata":"https://www.wikidata.org/wiki/Q7226636","display_name":"Polynomial code","level":5,"score":0.27810001373291016},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2669999897480011},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.26109999418258667},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.25600001215934753},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2508000135421753}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1109/tit.2012.2204955","doi":"https://doi.org/10.1109/tit.2012.2204955","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2012.2204955","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,"listed_in":["anvur-class-a","anvur-scientific","ccf-a","cwts-core","dongbi-a","jufo-3","norway-2","poland-200","russia-white-list-1"],"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:arXiv.org:1105.0703","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/1105.0703","pdf_url":"https://arxiv.org/pdf/1105.0703","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.365.9285","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.365.9285","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cmrr.ucsd.edu/people/siegel/documents/ACG_ALP.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.415.1542","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.415.1542","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cmrr-star.ucsd.edu/starpapers/xzhang_it12.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.765.5576","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.765.5576","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/1105.0703.pdf","raw_type":"text"},{"id":"doi:10.48550/arxiv.1105.0703","doi":"https://doi.org/10.48550/arxiv.1105.0703","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1105.0703","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1105.0703","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/1105.0703","pdf_url":"https://arxiv.org/pdf/1105.0703","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G7658639056","display_name":"Code Representation and Performance of Graph-Based Decoding","funder_award_id":"0829865","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320332603","display_name":"University of California, San Diego","ror":"https://ror.org/0168r3w48"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1644601915.pdf","grobid_xml":"https://content.openalex.org/works/W1644601915.grobid-xml"},"referenced_works_count":31,"referenced_works":["https://openalex.org/W152471750","https://openalex.org/W391578156","https://openalex.org/W1540596864","https://openalex.org/W1572884776","https://openalex.org/W1588943481","https://openalex.org/W1652876111","https://openalex.org/W1964319675","https://openalex.org/W1970755778","https://openalex.org/W2033546746","https://openalex.org/W2078633872","https://openalex.org/W2089745384","https://openalex.org/W2097981865","https://openalex.org/W2100850889","https://openalex.org/W2104689908","https://openalex.org/W2128765501","https://openalex.org/W2129031807","https://openalex.org/W2137813581","https://openalex.org/W2140250923","https://openalex.org/W2144456414","https://openalex.org/W2156938362","https://openalex.org/W2158665129","https://openalex.org/W2169134868","https://openalex.org/W2170915934","https://openalex.org/W2180587738","https://openalex.org/W2549082795","https://openalex.org/W3105799065","https://openalex.org/W4206416237","https://openalex.org/W4232148941","https://openalex.org/W4256648168","https://openalex.org/W4285719527","https://openalex.org/W4300188436"],"related_works":["https://openalex.org/W2121177891","https://openalex.org/W2342129673","https://openalex.org/W1976819640","https://openalex.org/W2140250923","https://openalex.org/W7096567379","https://openalex.org/W2591810314","https://openalex.org/W7098367440","https://openalex.org/W2433970104","https://openalex.org/W2108353263","https://openalex.org/W2078633872"],"abstract_inverted_index":{"Linear":[0],"programming":[1,19],"(LP)":[2],"decoding":[3,7,195,204],"approximates":[4],"maximum-likelihood":[5],"(ML)":[6],"of":[8,37,44,60,64,150,155,165],"a":[9,23,35,42,61,80,85,90,98,107,147],"linear":[10,45,157],"block":[11,158],"code":[12,66],"by":[13,34,57,130],"relaxing":[14],"the":[15,54,58,65,101,131,137,156,166,179,193,199],"equivalent":[16],"ML":[17,206],"integer":[18],"(IP)":[20],"problem":[21,31],"into":[22],"more":[24,172],"easily":[25],"solved":[26],"LP":[27,30,132,203],"problem.":[28],"The":[29,141],"is":[32,144,176],"defined":[33],"set":[36,43],"box":[38],"constraints":[39,55,124],"together":[40],"with":[41,178],"inequalities":[46,115],"called":[47],"\u201cparity":[48],"inequalities\u201d":[49],"that":[50,125,192],"are":[51],"derived":[52,116],"from":[53,117],"represented":[56],"rows":[59],"parity-check":[62,153,188],"matrix":[63,154],"and":[67,72,84,109,205],"can":[68,126],"be":[69],"added":[70],"iteratively":[71],"adaptively.":[73],"In":[74],"this":[75],"paper,":[76],"we":[77,105],"first":[78],"derive":[79],"new":[81,86,108,180],"necessary":[82],"condition":[83,88],"sufficient":[87],"for":[89,185],"violated":[91],"parity":[92,114,121],"inequality":[93],"constraint,":[94],"or":[95],"\u201ccut,\u201d":[96],"at":[97],"point":[99],"in":[100],"unit":[102],"hypercube.":[103],"Then,":[104],"propose":[106],"effective":[110],"algorithm":[111,143],"to":[112,169],"generate":[113],"certain":[118],"additional":[119],"redundant":[120],"check":[122],"(RPC)":[123],"eliminate":[127],"pseudocodewords":[128],"produced":[129],"decoder,":[133],"often":[134],"significantly":[135,197],"improving":[136],"decoder":[138,168],"error-rate":[139],"performance.":[140],"cut-generating":[142,181],"based":[145],"upon":[146],"specific":[148],"transformation":[149],"an":[151],"initial":[152],"code.":[159],"We":[160],"also":[161],"design":[162],"two":[163],"variations":[164],"proposed":[167,194],"make":[170],"it":[171,175],"efficient":[173],"when":[174],"combined":[177],"algorithm.":[182],"Simulation":[183],"results":[184],"several":[186],"low-density":[187],"(LDPC)":[189],"codes":[190],"demonstrate":[191],"algorithms":[196],"narrow":[198],"performance":[200],"gap":[201],"between":[202],"decoding.":[207]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":10},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2016-06-24T00:00:00"}