{"id":"https://openalex.org/W2510660017","doi":"https://doi.org/10.1109/isit.2016.7541850","title":"On the decoding delay of rate-1/2 complex orthogonal designs","display_name":"On the decoding delay of rate-1/2 complex orthogonal designs","publication_year":2016,"publication_date":"2016-07-01","ids":{"openalex":"https://openalex.org/W2510660017","doi":"https://doi.org/10.1109/isit.2016.7541850","mag":"2510660017"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2016.7541850","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2016.7541850","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Symposium on Information Theory (ISIT)","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/A5101810218","display_name":"Smarajit Das","orcid":"https://orcid.org/0000-0001-6260-6129"},"institutions":[{"id":"https://openalex.org/I1317621060","display_name":"Indian Institute of Technology Guwahati","ror":"https://ror.org/0022nd079","country_code":"IN","type":"education","lineage":["https://openalex.org/I1317621060"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Smarajit Das","raw_affiliation_strings":["Department of Electronics and Electrical Engineering, Indian Institute of Technology Guwahati, Assam, India-781039","Department of Electronics and Electrical Engineering, Indian Institute of Technology Guwahati, Assam, India"],"affiliations":[{"raw_affiliation_string":"Department of Electronics and Electrical Engineering, Indian Institute of Technology Guwahati, Assam, India-781039","institution_ids":["https://openalex.org/I1317621060"]},{"raw_affiliation_string":"Department of Electronics and Electrical Engineering, Indian Institute of Technology Guwahati, Assam, India","institution_ids":["https://openalex.org/I1317621060"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5101810218"],"corresponding_institution_ids":["https://openalex.org/I1317621060"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07245994,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"3003","last_page":"3007"},"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/T11797","display_name":"graph theory and CDMA systems","score":0.9997000098228455,"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.9983000159263611,"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/decoding-methods","display_name":"Decoding methods","score":0.8723968863487244},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.6602104306221008},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.6491417288780212},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.6169308423995972},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5655379891395569},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5323759913444519},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.5093766450881958},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4105958640575409},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.384662002325058},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3782643973827362},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.2194165289402008}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8723968863487244},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.6602104306221008},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.6491417288780212},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.6169308423995972},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5655379891395569},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5323759913444519},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.5093766450881958},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4105958640575409},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.384662002325058},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3782643973827362},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.2194165289402008},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2016.7541850","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2016.7541850","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Symposium on Information Theory (ISIT)","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":13,"referenced_works":["https://openalex.org/W1989446323","https://openalex.org/W2064166232","https://openalex.org/W2067297755","https://openalex.org/W2090380222","https://openalex.org/W2110659753","https://openalex.org/W2123848733","https://openalex.org/W2130900420","https://openalex.org/W2148018445","https://openalex.org/W2151730837","https://openalex.org/W2156206034","https://openalex.org/W2166305844","https://openalex.org/W3098224364","https://openalex.org/W4249553427"],"related_works":["https://openalex.org/W3017203753","https://openalex.org/W4205451769","https://openalex.org/W2385322349","https://openalex.org/W2029144766","https://openalex.org/W2348545647","https://openalex.org/W2052976169","https://openalex.org/W2983681086","https://openalex.org/W2369600518","https://openalex.org/W2089275957","https://openalex.org/W2165241191"],"abstract_inverted_index":{"Rate-1/2":[0],"Complex":[1],"orthogonal":[2],"designs":[3],"(CODs)":[4],"is":[5,24,61,92,125],"an":[6,42],"important":[7,43],"class":[8,108],"of":[9,21,29,38,54,109,115],"space-time":[10],"block":[11],"codes":[12,23,67],"due":[13],"to":[14],"the":[15,18,30,34,51,55,72,76,95,100,113,122],"fact":[16],"that":[17,28,94],"decoding":[19,36,52,73,101,119],"delay":[20,37,53,74,102,120],"these":[22],"substantially":[25],"less":[26],"than":[27],"maximal-rate":[31],"CODs.":[32,111],"Determining":[33],"least":[35],"rate-1/2":[39,56,110,116],"CODs":[40,57,117],"remains":[41],"open":[44],"problem.":[45],"Nonetheless,":[46],"a":[47],"lower":[48,77,97,123],"bound":[49,78,98,124],"on":[50],"with":[58,71,118],"2m":[59],"columns":[60],"obtained":[62],"under":[63],"certain":[64],"assumptions":[65],"and":[66,84],"have":[68],"been":[69],"constructed":[70],"meeting":[75,121],"for":[79,99,105,127],"m":[80],"=":[81],"1,":[82],"2":[83],"3":[85],"modulo":[86],"4.":[87],"In":[88],"this":[89],"paper,":[90],"it":[91],"shown":[93],"same":[96],"holds":[103],"even":[104],"more":[106],"general":[107],"Furthermore,":[112],"construction":[114],"provided":[126],"all":[128],"m.":[129]},"counts_by_year":[],"updated_date":"2026-03-21T06:30:42.041108","created_date":"2025-10-10T00:00:00"}