{"id":"https://openalex.org/W2566973880","doi":"https://doi.org/10.1109/isit.2005.1523525","title":"On optimal quasi-orthogonal space-time block codes with minimum decoding complexity","display_name":"On optimal quasi-orthogonal space-time block codes with minimum decoding complexity","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2566973880","doi":"https://doi.org/10.1109/isit.2005.1523525","mag":"2566973880"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2005.1523525","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523525","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","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/A5101567972","display_name":"Haiquan Wang","orcid":"https://orcid.org/0000-0002-5895-1787"},"institutions":[{"id":"https://openalex.org/I86501945","display_name":"University of Delaware","ror":"https://ror.org/01sbq1a82","country_code":"US","type":"education","lineage":["https://openalex.org/I86501945"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Haiquan Wang","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Delaware, Newark, DE, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Delaware, Newark, DE, USA","institution_ids":["https://openalex.org/I86501945"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100391562","display_name":"Dong Wang","orcid":"https://orcid.org/0000-0003-4872-4860"},"institutions":[{"id":"https://openalex.org/I86501945","display_name":"University of Delaware","ror":"https://ror.org/01sbq1a82","country_code":"US","type":"education","lineage":["https://openalex.org/I86501945"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dong Wang","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Delaware, Newark, DE, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Delaware, Newark, DE, USA","institution_ids":["https://openalex.org/I86501945"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065367615","display_name":"Xiang\u2010Gen Xia","orcid":"https://orcid.org/0000-0002-5599-7683"},"institutions":[{"id":"https://openalex.org/I86501945","display_name":"University of Delaware","ror":"https://ror.org/01sbq1a82","country_code":"US","type":"education","lineage":["https://openalex.org/I86501945"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xiang-gen Xia","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Delaware, Newark, DE, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Delaware, Newark, DE, USA","institution_ids":["https://openalex.org/I86501945"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101567972"],"corresponding_institution_ids":["https://openalex.org/I86501945"],"apc_list":null,"apc_paid":null,"fwci":4.2682,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.94353878,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1168","last_page":"1172"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":1.0,"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":1.0,"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/T10575","display_name":"Wireless Communication Networks Research","score":0.9995999932289124,"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.9994999766349792,"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.8711944222450256},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.7158986330032349},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.5710005164146423},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.5075036883354187},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5041841268539429},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4991326332092285},{"id":"https://openalex.org/keywords/product","display_name":"Product (mathematics)","score":0.48691093921661377},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4535554051399231},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44663166999816895},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.42471373081207275},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.24916845560073853},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.23442548513412476}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8711944222450256},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.7158986330032349},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.5710005164146423},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.5075036883354187},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5041841268539429},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4991326332092285},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.48691093921661377},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4535554051399231},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44663166999816895},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.42471373081207275},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.24916845560073853},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.23442548513412476},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2005.1523525","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523525","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":52,"referenced_works":["https://openalex.org/W144146220","https://openalex.org/W1537698448","https://openalex.org/W1561470659","https://openalex.org/W1956475064","https://openalex.org/W1978776062","https://openalex.org/W1986283595","https://openalex.org/W1989446323","https://openalex.org/W1994406803","https://openalex.org/W1995990042","https://openalex.org/W2038617545","https://openalex.org/W2081228459","https://openalex.org/W2099409344","https://openalex.org/W2100436459","https://openalex.org/W2100757816","https://openalex.org/W2103035110","https://openalex.org/W2104281364","https://openalex.org/W2106100486","https://openalex.org/W2107080958","https://openalex.org/W2110238624","https://openalex.org/W2110659753","https://openalex.org/W2117359246","https://openalex.org/W2117507580","https://openalex.org/W2118040894","https://openalex.org/W2118102112","https://openalex.org/W2120643640","https://openalex.org/W2123152632","https://openalex.org/W2123990342","https://openalex.org/W2124194899","https://openalex.org/W2128284487","https://openalex.org/W2130900420","https://openalex.org/W2136359522","https://openalex.org/W2141179114","https://openalex.org/W2141335099","https://openalex.org/W2144042251","https://openalex.org/W2148018445","https://openalex.org/W2150310322","https://openalex.org/W2151380152","https://openalex.org/W2156855998","https://openalex.org/W2158210223","https://openalex.org/W2159233525","https://openalex.org/W2160343398","https://openalex.org/W2166837934","https://openalex.org/W2166924237","https://openalex.org/W2168228964","https://openalex.org/W2172121953","https://openalex.org/W2219471282","https://openalex.org/W2289669645","https://openalex.org/W2481204018","https://openalex.org/W2566973880","https://openalex.org/W6670873668","https://openalex.org/W6679316260","https://openalex.org/W6683437696"],"related_works":["https://openalex.org/W3017203753","https://openalex.org/W4205451769","https://openalex.org/W2385322349","https://openalex.org/W2348545647","https://openalex.org/W2052976169","https://openalex.org/W2369600518","https://openalex.org/W2029144766","https://openalex.org/W2089275957","https://openalex.org/W2165241191","https://openalex.org/W2964031101"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"first":[4],"present":[5,31],"a":[6],"necessary":[7],"and":[8],"sufficient":[9],"condition":[10],"on":[11],"linear":[12,33],"transformations":[13,34],"for":[14,38],"an":[15],"QOSTBC":[16],"to":[17],"possess":[18],"the":[19,53,56,65],"minimum":[20,45],"ML":[21,46],"decoding":[22,47],"complexity,":[23],"i.e.,":[24],"real":[25],"symbol":[26],"pair-wise":[27],"decoding.":[28],"We":[29],"then":[30],"optimal":[32],"of":[35],"information":[36],"symbols":[37],"quasi-orthogonal":[39],"space-time":[40],"block":[41],"codes":[42],"(QOSTBC)":[43],"with":[44],"complexity.":[48],"The":[49],"optimality":[50],"is":[51,62,69],"in":[52],"sense":[54],"that":[55],"diversity":[57],"product":[58,60],"(or":[59],"distance)":[61],"maximized":[63],"when":[64],"mean":[66],"transmission":[67],"power":[68],"fixed":[70]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}