{"id":"https://openalex.org/W4205661203","doi":"https://doi.org/10.1109/sfcs.2002.1181948","title":"Decoding turbo-like codes via linear programming","display_name":"Decoding turbo-like codes via linear programming","publication_year":2003,"publication_date":"2003-06-26","ids":{"openalex":"https://openalex.org/W4205661203","doi":"https://doi.org/10.1109/sfcs.2002.1181948"},"language":"en","primary_location":{"id":"doi:10.1109/sfcs.2002.1181948","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2002.1181948","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.","raw_type":"proceedings-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/A5042697545","display_name":"Jon Feldman","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"J. Feldman","raw_affiliation_strings":["Laboratory for Computer Science, MIT, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Laboratory for Computer Science, MIT, Cambridge, MA, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028448267","display_name":"David R. Karger","orcid":"https://orcid.org/0000-0002-0024-5847"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"D.R. Karger","raw_affiliation_strings":["Laboratory for Computer Science, MIT, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Laboratory for Computer Science, MIT, Cambridge, MA, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5042697545"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9921,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.83178386,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"251","last_page":"260"},"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.9990000128746033,"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.9983999729156494,"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/binary-symmetric-channel","display_name":"Binary symmetric channel","score":0.6355874538421631},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6310195922851562},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.5811763405799866},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5508657693862915},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.5448264479637146},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.5428372621536255},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5188339948654175},{"id":"https://openalex.org/keywords/polynomial-code","display_name":"Polynomial code","score":0.5146232843399048},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5055561065673828},{"id":"https://openalex.org/keywords/constant-weight-code","display_name":"Constant-weight code","score":0.4880601167678833},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.47690534591674805},{"id":"https://openalex.org/keywords/systematic-code","display_name":"Systematic code","score":0.4283982813358307},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.4236634075641632},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3658513128757477},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34842967987060547},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.20805633068084717}],"concepts":[{"id":"https://openalex.org/C173988684","wikidata":"https://www.wikidata.org/wiki/Q863510","display_name":"Binary symmetric channel","level":4,"score":0.6355874538421631},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6310195922851562},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.5811763405799866},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5508657693862915},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.5448264479637146},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.5428372621536255},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5188339948654175},{"id":"https://openalex.org/C39635130","wikidata":"https://www.wikidata.org/wiki/Q7226636","display_name":"Polynomial code","level":5,"score":0.5146232843399048},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5055561065673828},{"id":"https://openalex.org/C197242373","wikidata":"https://www.wikidata.org/wiki/Q5163613","display_name":"Constant-weight code","level":5,"score":0.4880601167678833},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.47690534591674805},{"id":"https://openalex.org/C70992990","wikidata":"https://www.wikidata.org/wiki/Q1681587","display_name":"Systematic code","level":4,"score":0.4283982813358307},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.4236634075641632},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3658513128757477},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34842967987060547},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.20805633068084717}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/sfcs.2002.1181948","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2002.1181948","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W147465018","https://openalex.org/W1991133427","https://openalex.org/W2020992040","https://openalex.org/W2040075573","https://openalex.org/W2065465262","https://openalex.org/W2104043302","https://openalex.org/W2117828856","https://openalex.org/W2121606987","https://openalex.org/W2127490352","https://openalex.org/W2129031807","https://openalex.org/W2150212378","https://openalex.org/W2169732368","https://openalex.org/W4239653277","https://openalex.org/W6605892194","https://openalex.org/W7030204149"],"related_works":["https://openalex.org/W2171391334","https://openalex.org/W2082705204","https://openalex.org/W4250402636","https://openalex.org/W2377508920","https://openalex.org/W2886619161","https://openalex.org/W1631960500","https://openalex.org/W4212825216","https://openalex.org/W2109423364","https://openalex.org/W4245351974","https://openalex.org/W1979611478"],"abstract_inverted_index":{"We":[0,13],"introduce":[1],"a":[2,29,76,87,93],"novel":[3],"algorithm":[4,42],"for":[5,16],"decoding":[6],"turbo-like":[7],"codes":[8],"based":[9,74,105],"on":[10,34,75,106],"linear":[11,54],"programming.":[12],"prove":[14],"that":[15,119],"the":[17,24,35,37,50,58,61,68,79,90,97,110,113,117,120,124,127,131],"case":[18],"of":[19,40,78,109,116],"repeat-accumulate":[20],"(RA)":[21],"codes,":[22],"under":[23],"binary":[25,65],"symmetric":[26],"channel":[27],"with":[28],"certain":[30],"constant":[31],"threshold":[32],"bound":[33],"noise,":[36],"error":[38,102],"probability":[39],"our":[41],"is":[43,73,126],"bounded":[44],"by":[45],"an":[46,107],"inverse":[47],"polynomial":[48],"in":[49],"code":[51,69,80,82,134],"length.":[52],"Our":[53,71],"program":[55],"(LP)":[56],"minimizes":[57],"distance":[59],"between":[60],"received":[62],"bits":[63],"and":[64],"variables":[66],"representing":[67],"bits.":[70],"LP":[72,91,125],"representation":[77],"where":[81],"words":[83],"are":[84,104],"paths":[85],"through":[86],"graph.":[88],"Consequently,":[89],"bears":[92],"strong":[94],"resemblance":[95],"to":[96,123,130],"min-cost":[98],"flow":[99],"LP.":[100],"The":[101],"bounds":[103],"analysis":[108],"probability,":[111],"over":[112],"random":[114],"noise":[115],"channel,":[118],"optimum":[121],"solution":[122],"path":[128],"corresponding":[129],"original":[132],"transmitted":[133],"word.":[135]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}