{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003554646,0.0001465276,0.0001094078,0.0001836689,0.000335798,0.00009433684,0.0003048823,0.0001166278,0.00005140819],"category_scores_gemma":[0.00001105665,0.0001279124,0.000101499,0.0002253462,0.00007272253,0.0008921325,0.0000020316,0.0003464021,0.00003608166],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001336853,"about_ca_system_score_gemma":0.00002181264,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007562169,"about_ca_topic_score_gemma":0.00001406305,"domain_scores_codex":[0.9991428,0.00004799972,0.00036324,0.00007304517,0.0001600013,0.0002129739],"domain_scores_gemma":[0.9988692,0.0005091571,0.00005282859,0.000463002,0.00007473938,0.0000311051],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00007422284,0.00002039111,5.627678e-7,0.00004762724,0.00003339613,8.597436e-8,0.0007213442,0.7155098,0.0008387783,0.1923702,0.0002601786,0.09012341],"study_design_scores_gemma":[0.0006741035,0.00006676025,0.00002792302,0.0001119396,0.00004314246,0.000009410008,0.001028063,0.2859149,0.5078139,0.1940788,0.009766826,0.0004641853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002646626,0.00002774024,0.9914839,0.0001127606,0.0003364153,0.0004654977,0.00004899035,0.0007812476,0.004096881],"genre_scores_gemma":[0.9562828,0.00007117074,0.04299467,0.0001067772,0.00005291062,0.0003463009,0.00002191509,0.00002887228,0.00009458957],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9536362,"threshold_uncertainty_score":0.5216116,"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."}}