{"id":"https://openalex.org/W2098282705","doi":"https://doi.org/10.1109/icc.2004.1312583","title":"A new adaptive two-stage maximum-likelihood decoding algorithm for linear block codes","display_name":"A new adaptive two-stage maximum-likelihood decoding algorithm for linear block codes","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2098282705","doi":"https://doi.org/10.1109/icc.2004.1312583","mag":"2098282705"},"language":"en","primary_location":{"id":"doi:10.1109/icc.2004.1312583","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2004.1312583","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577)","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/A5056327156","display_name":"Xianren Wu","orcid":null},"institutions":[{"id":"https://openalex.org/I11957088","display_name":"Michigan Technological University","ror":"https://ror.org/0036rpn28","country_code":"US","type":"education","lineage":["https://openalex.org/I11957088"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xianren Wu","raw_affiliation_strings":["Electrical and Computer Engineering, Michigan Technological University, Houghton, MI, USA","Dept. of Electr. & Comput. Eng., Michigan Technol. Univ., Houghton, MI, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering, Michigan Technological University, Houghton, MI, USA","institution_ids":["https://openalex.org/I11957088"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Michigan Technol. Univ., Houghton, MI, USA","institution_ids":["https://openalex.org/I11957088"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002386673","display_name":"Hamid R. Sadjadpour","orcid":"https://orcid.org/0000-0003-4279-4745"},"institutions":[{"id":"https://openalex.org/I185103710","display_name":"University of California, Santa Cruz","ror":"https://ror.org/03s65by71","country_code":"US","type":"education","lineage":["https://openalex.org/I185103710"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"H.R. Sadjadpour","raw_affiliation_strings":["Electrical Engineering, University of California, Santa Cruz, CA, USA","University of California/Santa Cruz"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical Engineering, University of California, Santa Cruz, CA, USA","institution_ids":["https://openalex.org/I185103710"]},{"raw_affiliation_string":"University of California/Santa Cruz","institution_ids":["https://openalex.org/I185103710"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073942971","display_name":"Zhi Tian","orcid":"https://orcid.org/0000-0002-2738-6826"},"institutions":[{"id":"https://openalex.org/I11957088","display_name":"Michigan Technological University","ror":"https://ror.org/0036rpn28","country_code":"US","type":"education","lineage":["https://openalex.org/I11957088"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhi Tian","raw_affiliation_strings":["Electrical and Computer Engineering, Michigan Technological University, Houghton, MI, USA",", Michigan Technological University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering, Michigan Technological University, Houghton, MI, USA","institution_ids":["https://openalex.org/I11957088"]},{"raw_affiliation_string":", Michigan Technological University","institution_ids":["https://openalex.org/I11957088"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.15401085,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"656","last_page":"660 Vol.2"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9998999834060669,"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.9998999834060669,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9994000196456909,"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/T10575","display_name":"Wireless Communication Networks Research","score":0.9970999956130981,"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/algorithm","display_name":"Algorithm","score":0.7556949257850647},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6939687728881836},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.6644675731658936},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.6249683499336243},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5574105381965637},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5317596197128296},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.4260072112083435},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.418567419052124},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3441648483276367},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3291533291339874},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.06347069144248962}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7556949257850647},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6939687728881836},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.6644675731658936},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.6249683499336243},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5574105381965637},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5317596197128296},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.4260072112083435},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.418567419052124},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3441648483276367},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3291533291339874},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.06347069144248962},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icc.2004.1312583","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2004.1312583","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577)","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":19,"referenced_works":["https://openalex.org/W1485843586","https://openalex.org/W1505084949","https://openalex.org/W1992322264","https://openalex.org/W2023355697","https://openalex.org/W2049785349","https://openalex.org/W2100404241","https://openalex.org/W2102431578","https://openalex.org/W2105866504","https://openalex.org/W2120233256","https://openalex.org/W2122670052","https://openalex.org/W2138779125","https://openalex.org/W2145969665","https://openalex.org/W2152227186","https://openalex.org/W2152258228","https://openalex.org/W2155316710","https://openalex.org/W2156826724","https://openalex.org/W2167657277","https://openalex.org/W2798847826","https://openalex.org/W6629020187"],"related_works":["https://openalex.org/W2365048703","https://openalex.org/W2029144766","https://openalex.org/W3017203753","https://openalex.org/W2348545647","https://openalex.org/W2385322349","https://openalex.org/W2357077655","https://openalex.org/W4205451769","https://openalex.org/W4289713215","https://openalex.org/W2089275957","https://openalex.org/W2052976169"],"abstract_inverted_index":{"This":[0],"work":[1],"presents":[2],"a":[3,25,32,154],"maximum-likelihood":[4],"(ML)":[5],"decoding":[6,50],"algorithm":[7,131,149],"for":[8],"linear":[9],"block":[10,126,137],"codes.":[11,139],"In":[12],"this":[13,148],"algorithm,":[14],"the":[15,29,39,45,49,60,68,76,80,89,102,114],"optimal":[16,40,77,103,115,151],"performance":[17,57,152],"is":[18,42,65,84,97,105,132],"achieved":[19],"at":[20],"low":[21,155],"computational":[22,90,157],"complexity":[23,51],"through":[24],"two-stage":[26],"processing.":[27],"At":[28,59],"first":[30],"stage,":[31,62],"minimum":[33,46,70],"sufficient":[34,47,71],"set":[35,72],"S":[36,73,83],"that":[37,147],"includes":[38],"solution":[41,104,116],"estimated.":[43],"With":[44],"set,":[48],"can":[52],"be":[53],"greatly":[54],"reduced":[55],"without":[56],"degradation.":[58],"second":[61],"ordered":[63,81],"processing":[64,108],"performed":[66],"within":[67],"estimated":[69],"to":[74,87,99,112,135,145],"obtain":[75],"solution.":[78],"During":[79],"processing,":[82],"adoptively":[85],"updated":[86],"minimize":[88],"complexity,":[91],"and":[92],"an":[93],"effective":[94],"stopping":[95],"criterion":[96],"used":[98],"decide":[100],"whether":[101],"found.":[106],"Ordered":[107],"not":[109],"only":[110],"helps":[111],"find":[113],"quickly,":[117],"but":[118],"also":[119,133],"enables":[120],"simplified":[121],"sub-optimal":[122],"solutions":[123],"with":[124,153],"bounded":[125],"error":[127],"rates.":[128],"The":[129],"proposed":[130],"extended":[134],"decode":[136],"turbo":[138],"Finally,":[140],"simulation":[141],"results":[142],"are":[143],"given":[144],"show":[146],"achieves":[150],"average":[156],"complexity.":[158]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}