{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001753388,0.0002936908,0.0003076212,0.0001874864,0.0007879967,0.00006562135,0.001139706,0.0001551969,0.00008942498],"category_scores_gemma":[0.000005498212,0.0003564264,0.0002085322,0.0003852377,0.0002727546,0.0002689022,0.00001065884,0.000509003,0.00008463959],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002204555,"about_ca_system_score_gemma":0.00003603204,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005943633,"about_ca_topic_score_gemma":0.0004648042,"domain_scores_codex":[0.9986458,0.00009903823,0.0005035916,0.0002340114,0.0001736215,0.0003439448],"domain_scores_gemma":[0.9966703,0.000641076,0.00009250574,0.00234037,0.0001688322,0.0000868928],"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.00004263849,0.003147328,0.00001999502,0.0001947058,0.0003255959,0.000001634689,0.0003935227,0.3281913,0.04145765,0.02632058,0.005841839,0.5940632],"study_design_scores_gemma":[0.0005985074,0.00007919614,0.00006211075,0.0001225461,0.0000699279,0.00001385019,0.00006994652,0.8793282,0.09734147,0.009815848,0.01187248,0.0006259535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001657585,0.0003450543,0.9911987,0.0004226724,0.0001124434,0.0006514092,0.0004631842,0.001872124,0.003276851],"genre_scores_gemma":[0.5529435,0.0005219016,0.4453416,0.00002828305,0.00003097446,0.0005758748,0.00009661284,0.00007510181,0.0003861323],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5934373,"threshold_uncertainty_score":0.9998888,"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."}}