{"id":"W2117691901","doi":"10.1109/tcomm.2006.869881","title":"Low-complexity sphere decoding algorithm for quasi-orthogonal space-time block codes","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Block code; Decoding methods; Algorithm; Computational complexity theory; Space time; Metric (unit); Mathematics; Computer science; Block (permutation group theory); Concatenated error correction code; Combinatorics; Engineering","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008146604,0.0006994714,0.0007457713,0.0006682143,0.0003721332,0.00087321,0.0005229279,0.0006620495,0.002278444],"category_scores_gemma":[0.003651884,0.00020274,0.0003275122,0.0009839016,0.0006311656,0.0009886214,0.000686685,0.0009046721,0.002394565],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005901488,"about_ca_system_score_gemma":0.001287552,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001796351,"about_ca_topic_score_gemma":0.002292397,"domain_scores_codex":[0.9988868,0.0003871291,0.0000682033,0.00008932144,0.0005105608,0.00005795453],"domain_scores_gemma":[0.9983869,0.0006066351,0.0001266962,0.0003403268,0.0004953242,0.00004405456],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004454875,0.00008066648,0.0008010134,0.0002451384,0.00007596886,0.0001369863,0.0001510413,0.1723265,0.04487898,0.164362,0.01003694,0.6064593],"study_design_scores_gemma":[0.00004451778,0.00008696802,0.0002785749,0.00001756971,0.00001065561,0.000197429,0.0000168372,0.9351538,0.02456865,0.02833664,0.01125587,0.00003243383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003609419,0.0002368814,0.9939248,0.00008780317,0.00004472456,0.00001940333,0.00004656654,0.0004139102,0.001616567],"genre_scores_gemma":[0.144037,0.0007399222,0.8487055,0.0001366982,0.0001201866,0.0001216698,0.0004838553,0.000162389,0.005492794],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002278444,"threshold_uncertainty_score":0.007622182,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02592500877808454,"score_gpt":0.2732119221488582,"score_spread":0.2472869133707737,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}