{"id":"https://openalex.org/W2078633872","doi":"https://doi.org/10.1109/tit.2008.2006384","title":"Adaptive Methods for Linear Programming Decoding","display_name":"Adaptive Methods for Linear Programming Decoding","publication_year":2008,"publication_date":"2008-12-01","ids":{"openalex":"https://openalex.org/W2078633872","doi":"https://doi.org/10.1109/tit.2008.2006384","mag":"2078633872"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2008.2006384","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2008.2006384","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/A5111878365","display_name":"M. Hossein Taghavi","orcid":null},"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":true,"raw_author_name":"Mohammad H. Taghavi N.","raw_affiliation_strings":["Dept. of Electr. & Comput. Eng., Univ. of California, La Jolla, CA#TAB#"],"affiliations":[{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Univ. of California, La Jolla, CA#TAB#","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009125536","display_name":"P.H. Siegel","orcid":null},"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, University of California, La Jolla, CA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of California, La Jolla, CA, USA","institution_ids":["https://openalex.org/I36258959"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5111878365"],"corresponding_institution_ids":["https://openalex.org/I36258959"],"apc_list":null,"apc_paid":null,"fwci":16.3901,"has_fulltext":false,"cited_by_count":124,"citation_normalized_percentile":{"value":0.99225639,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"54","issue":"12","first_page":"5396","last_page":"5410"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9988999962806702,"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.9988999962806702,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9878000020980835,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9868999719619751,"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.8961876630783081},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.7606692314147949},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5643165707588196},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5037633776664734},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4977629482746124},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.468680202960968},{"id":"https://openalex.org/keywords/parity-check-matrix","display_name":"Parity-check matrix","score":0.4228416085243225},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3844435214996338},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3280726671218872},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.15073102712631226},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.07281756401062012},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.06068882346153259}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8961876630783081},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.7606692314147949},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5643165707588196},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5037633776664734},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4977629482746124},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.468680202960968},{"id":"https://openalex.org/C95925971","wikidata":"https://www.wikidata.org/wiki/Q3100414","display_name":"Parity-check matrix","level":4,"score":0.4228416085243225},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3844435214996338},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3280726671218872},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.15073102712631226},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.07281756401062012},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.06068882346153259}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/tit.2008.2006384","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2008.2006384","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.342.969","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.969","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/cs/0703123v1.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.415.814","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.415.814","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/hossein_adaptive_lp.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.88.1649","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.88.1649","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://vivaldi.ucsd.edu:8080/starpapers/hossein-UP07b.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W193818406","https://openalex.org/W1588943481","https://openalex.org/W1652876111","https://openalex.org/W1875056259","https://openalex.org/W2009683816","https://openalex.org/W2019599312","https://openalex.org/W2021644092","https://openalex.org/W2077397558","https://openalex.org/W2089745384","https://openalex.org/W2108619558","https://openalex.org/W2115769160","https://openalex.org/W2141555819","https://openalex.org/W2144456414","https://openalex.org/W2163264905","https://openalex.org/W2169134868","https://openalex.org/W2962897197","https://openalex.org/W3029645440","https://openalex.org/W4285719527","https://openalex.org/W4300448178","https://openalex.org/W6607773459","https://openalex.org/W6635197353"],"related_works":["https://openalex.org/W3017203753","https://openalex.org/W3083229674","https://openalex.org/W4205451769","https://openalex.org/W2385322349","https://openalex.org/W2369600518","https://openalex.org/W3096151594","https://openalex.org/W2964031101","https://openalex.org/W2118148379","https://openalex.org/W2145403642","https://openalex.org/W2140459655"],"abstract_inverted_index":{"<para":[0],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[1],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">":[2],"Detectability":[3],"of":[4,6,23,66,84,96,99],"failures":[5],"linear":[7],"programming":[8],"(LP)":[9],"decoding":[10,68],"and":[11,48,58],"the":[12,21,29,32,61,64,82,85,97,100,124],"potential":[13],"for":[14,31],"improvement":[15],"by":[16,51],"adding":[17,60,108],"new":[18],"constraints":[19,30,113],"motivate":[20],"use":[22],"an":[24],"adaptive":[25,79],"approach":[26],"in":[27,44,123],"selecting":[28],"underlying":[33],"LP":[34,56,67,80,86],"problem.":[35],"In":[36,73],"this":[37,46],"paper,":[38],"we":[39,75],"make":[40],"a":[41,54],"first":[42],"step":[43],"studying":[45],"method,":[47],"show":[49,105],"that":[50,77,88,106],"starting":[52],"from":[53],"simple":[55],"problem":[57],"adaptively":[59,107],"necessary":[62],"constraints,":[63,110],"complexity":[65],"can":[69,119],"be":[70,91],"significantly":[71],"reduced.":[72],"particular,":[74],"observe":[76],"with":[78],"decoding,":[81],"sizes":[83],"problems":[87],"need":[89],"to":[90],"solved":[92],"become":[93],"practically":[94],"independent":[95],"density":[98],"parity-check":[101],"matrix.":[102],"We":[103],"further":[104],"extra":[109],"such":[111],"as":[112],"based":[114],"on":[115],"redundant":[116],"parity":[117],"checks,":[118],"provide":[120],"large":[121],"gains":[122],"performance.":[125],"</para>":[126]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":14},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":13},{"year":2013,"cited_by_count":11},{"year":2012,"cited_by_count":10}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2016-06-24T00:00:00"}