{"id":"W1683834415","doi":"10.1109/tit.2005.864418","title":"A unified framework for tree search decoding: rediscovering the sequential decoder","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":303,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decoding methods; Algorithm; Intersymbol interference; Computer science; MIMO; Tree (set theory); Search tree; Search algorithm; Tree structure; Mathematics; Theoretical computer science; Binary tree","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.00126493,0.0008478719,0.0008196434,0.00063791,0.0003998496,0.001340889,0.0009738096,0.001212281,0.002402192],"category_scores_gemma":[0.003271875,0.0003274016,0.0005652121,0.0009856528,0.001051871,0.001670878,0.0009927267,0.001359044,0.0008617144],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008241765,"about_ca_system_score_gemma":0.001618131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001548215,"about_ca_topic_score_gemma":0.001988904,"domain_scores_codex":[0.9991909,0.0003300228,0.00003632393,0.00008902611,0.0002895396,0.00006417155],"domain_scores_gemma":[0.9991085,0.0004657316,0.0000660272,0.0001309852,0.0001965681,0.00003222227],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007533263,0.0000388481,0.0003122776,0.0001204176,0.00002990661,0.0001351491,0.0001352179,0.3925899,0.005947396,0.5216677,0.001757712,0.07719012],"study_design_scores_gemma":[0.00001203297,0.00006040028,0.00003929227,0.00001886775,0.000007934256,0.00008240047,0.00001726189,0.9066104,0.002072889,0.08804725,0.003017065,0.00001417494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009779149,0.00009915749,0.997677,0.00004557215,0.00001015693,0.000009090056,0.00001457375,0.00003408623,0.001132415],"genre_scores_gemma":[0.172284,0.001233859,0.8209911,0.0002014022,0.0001389843,0.0001471386,0.0001149003,0.00008818688,0.004800533],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002402192,"threshold_uncertainty_score":0.008036137,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01725278796548103,"score_gpt":0.2677141701677557,"score_spread":0.2504613822022747,"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."}}