{"id":"https://openalex.org/W2079063596","doi":"https://doi.org/10.1109/icc.2012.6363870","title":"A low-complexity tree-search algorithm to decode diversity-oriented block codes with inter-symbol interference","display_name":"A low-complexity tree-search algorithm to decode diversity-oriented block codes with inter-symbol interference","publication_year":2012,"publication_date":"2012-06-01","ids":{"openalex":"https://openalex.org/W2079063596","doi":"https://doi.org/10.1109/icc.2012.6363870","mag":"2079063596"},"language":"en","primary_location":{"id":"doi:10.1109/icc.2012.6363870","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2012.6363870","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Conference on Communications (ICC)","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/A5101812914","display_name":"Chong Xu","orcid":"https://orcid.org/0000-0002-1093-7660"},"institutions":[{"id":"https://openalex.org/I1321296531","display_name":"National Institute of Standards and Technology","ror":"https://ror.org/05xpvk416","country_code":"US","type":"funder","lineage":["https://openalex.org/I1321296531","https://openalex.org/I1343035065"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Chong Xu","raw_affiliation_strings":["National Institute for Standards and Technology, Gaithersburg, USA","National Institute of Standards and Technology, Gaithersburg, USA"],"affiliations":[{"raw_affiliation_string":"National Institute for Standards and Technology, Gaithersburg, USA","institution_ids":["https://openalex.org/I1321296531"]},{"raw_affiliation_string":"National Institute of Standards and Technology, Gaithersburg, USA","institution_ids":["https://openalex.org/I1321296531"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062830296","display_name":"Hamid Gharavi","orcid":"https://orcid.org/0000-0003-3832-488X"},"institutions":[{"id":"https://openalex.org/I1321296531","display_name":"National Institute of Standards and Technology","ror":"https://ror.org/05xpvk416","country_code":"US","type":"funder","lineage":["https://openalex.org/I1321296531","https://openalex.org/I1343035065"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hamid Gharavi","raw_affiliation_strings":["National Institute for Standards and Technology, Gaithersburg, USA","National Institute of Standards and Technology, Gaithersburg, USA"],"affiliations":[{"raw_affiliation_string":"National Institute for Standards and Technology, Gaithersburg, USA","institution_ids":["https://openalex.org/I1321296531"]},{"raw_affiliation_string":"National Institute of Standards and Technology, Gaithersburg, USA","institution_ids":["https://openalex.org/I1321296531"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101812914"],"corresponding_institution_ids":["https://openalex.org/I1321296531"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.17162257,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"2002","issue":null,"first_page":"4240","last_page":"4245"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9994999766349792,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9994999766349792,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9980000257492065,"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.9973000288009644,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6598235368728638},{"id":"https://openalex.org/keywords/symbol","display_name":"Symbol (formal)","score":0.5980799794197083},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5881845355033875},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.5830429196357727},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.544335663318634},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.5096848011016846},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4837231934070587},{"id":"https://openalex.org/keywords/guard-interval","display_name":"Guard interval","score":0.47983452677726746},{"id":"https://openalex.org/keywords/interference","display_name":"Interference (communication)","score":0.47471368312835693},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.46356046199798584},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.4533188045024872},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3760733902454376},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27939820289611816},{"id":"https://openalex.org/keywords/orthogonal-frequency-division-multiplexing","display_name":"Orthogonal frequency-division multiplexing","score":0.19502097368240356},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.16105538606643677},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.10489901900291443}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6598235368728638},{"id":"https://openalex.org/C134400042","wikidata":"https://www.wikidata.org/wiki/Q2372244","display_name":"Symbol (formal)","level":2,"score":0.5980799794197083},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5881845355033875},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.5830429196357727},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.544335663318634},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5096848011016846},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4837231934070587},{"id":"https://openalex.org/C2777796584","wikidata":"https://www.wikidata.org/wiki/Q1132816","display_name":"Guard interval","level":4,"score":0.47983452677726746},{"id":"https://openalex.org/C32022120","wikidata":"https://www.wikidata.org/wiki/Q797225","display_name":"Interference (communication)","level":3,"score":0.47471368312835693},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.46356046199798584},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.4533188045024872},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3760733902454376},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27939820289611816},{"id":"https://openalex.org/C40409654","wikidata":"https://www.wikidata.org/wiki/Q375889","display_name":"Orthogonal frequency-division multiplexing","level":3,"score":0.19502097368240356},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.16105538606643677},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.10489901900291443},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icc.2012.6363870","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2012.6363870","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Conference on Communications (ICC)","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":16,"referenced_works":["https://openalex.org/W2011396057","https://openalex.org/W2027635460","https://openalex.org/W2075718541","https://openalex.org/W2096974994","https://openalex.org/W2106907805","https://openalex.org/W2113398040","https://openalex.org/W2117359246","https://openalex.org/W2124333656","https://openalex.org/W2126483728","https://openalex.org/W2128504632","https://openalex.org/W2131387488","https://openalex.org/W2131876845","https://openalex.org/W2147695687","https://openalex.org/W2152797116","https://openalex.org/W2158997686","https://openalex.org/W6674763995"],"related_works":["https://openalex.org/W570526884","https://openalex.org/W1622094092","https://openalex.org/W2050483227","https://openalex.org/W2167845535","https://openalex.org/W2011556349","https://openalex.org/W1979641448","https://openalex.org/W2546012071","https://openalex.org/W4313259888","https://openalex.org/W360205557","https://openalex.org/W3148553898"],"abstract_inverted_index":{"In":[0,47],"order":[1],"to":[2,22,65,83,112],"contain":[3],"a":[4,9,16,52,93],"differential":[5],"propagation":[6],"delay":[7],"in":[8],"block":[10,31],"based":[11],"cooperative":[12],"Multiple-Input-Multiple-Output":[13],"(MIMO)":[14],"system,":[15],"guard":[17],"interval":[18],"can":[19],"be":[20],"inserted":[21],"mitigate":[23],"the":[24,36,42,79,85,88,103,115],"effect":[25],"of":[26,44,87,95,100,102],"inter-symbol":[27],"interference.":[28],"A":[29],"larger":[30],"size":[32],"could":[33],"substantially":[34],"increase":[35],"effective":[37,116],"symbol":[38,117],"rate,":[39],"although":[40],"at":[41],"expense":[43],"decoding":[45],"complexity.":[46],"this":[48],"paper,":[49],"we":[50,75],"propose":[51],"novel":[53],"low-complexity":[54],"breadth-adjustable":[55],"tree-search":[56],"algorithm,":[57],"which,":[58],"as":[59],"an":[60],"example,":[61],"has":[62],"been":[63],"applied":[64],"decode":[66],"Asynchronous":[67],"Cooperative":[68],"Liner":[69],"Dispersion":[70],"Codes":[71],"(ACLDC).":[72],"With":[73],"simulation":[74],"demonstrate":[76],"that":[77,101],"when":[78],"blocksize":[80],"is":[81,91],"equivalent":[82],"20,":[84],"complexity":[86],"proposed":[89],"algorithm":[90],"only":[92],"fraction":[94],"10":[96],"<sup":[97],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[98],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">-8</sup>":[99],"Maximum":[104],"Likelihood":[105],"(ML)":[106],"algorithm.":[107],"This":[108],"would":[109],"allow":[110],"us":[111],"practically":[113],"enhance":[114],"rate":[118],"without":[119],"any":[120],"performance":[121],"degradation.":[122]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}