{"id":"W2004310226","doi":"10.1109/icc.2012.6363736","title":"Decoding techniques for coded full-rate cooperative systems","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Detector; Decoding methods; Computer science; Bit error rate; Interference (communication); Algorithm; Maximum a posteriori estimation; Reliability (semiconductor); Real-time computing; Electronic engineering; Channel (broadcasting); Telecommunications; Mathematics; Maximum likelihood; Engineering; Statistics; Physics","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.000778406,0.0006037419,0.0005153143,0.000546762,0.0003150354,0.0007635829,0.000712716,0.0008126941,0.001449738],"category_scores_gemma":[0.003695306,0.000274439,0.0002870571,0.0005970593,0.0005650317,0.001236019,0.0009780802,0.0008816898,0.000663852],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004935998,"about_ca_system_score_gemma":0.0009535304,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007203961,"about_ca_topic_score_gemma":0.0008024158,"domain_scores_codex":[0.9993554,0.0001955723,0.0000323308,0.00007747144,0.000296572,0.00004273926],"domain_scores_gemma":[0.9988745,0.0005414808,0.0001144968,0.0001793379,0.0002727266,0.00001740996],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001602394,0.00006233944,0.000508157,0.0004059862,0.00008546053,0.0002338388,0.0004668715,0.4434235,0.0343945,0.2446466,0.002494265,0.2731182],"study_design_scores_gemma":[0.00002381012,0.00008812296,0.0001399512,0.00004600306,0.00002125405,0.0002560203,0.00003561923,0.9274937,0.009936187,0.05603922,0.005887927,0.00003211733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007827686,0.0006686017,0.9884796,0.0001358233,0.00003756391,0.00002649452,0.00002908877,0.0001502604,0.002644902],"genre_scores_gemma":[0.5409493,0.002065906,0.4485736,0.0003646151,0.0001175265,0.0001894928,0.0001524608,0.00006785423,0.007519305],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001449738,"threshold_uncertainty_score":0.004849851,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06575605713487163,"score_gpt":0.3194256288207087,"score_spread":0.2536695716858371,"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."}}