{"id":"W2021672277","doi":"10.1109/tcomm.2013.032013.120601","title":"Analysis of the Generalized DF-CF for Gaussian Relay Channels: Decode or Compress?","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Relay; Rayleigh fading; Topology (electrical circuits); Mathematics; Gaussian; Asymptotic analysis; Channel (broadcasting); Bounded function; Signal-to-noise ratio (imaging); Fading; Relay channel; Node (physics); Decoding methods; Computer science; Algorithm; Telecommunications; Power (physics); Statistics; Combinatorics; Engineering; Mathematical analysis","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.001674778,0.001411645,0.0009040961,0.0008423281,0.0005968371,0.001269919,0.001096644,0.001312159,0.003406565],"category_scores_gemma":[0.005379669,0.0003669919,0.0006418848,0.0009659008,0.002003719,0.001412259,0.001255435,0.0009001258,0.0004022974],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001951154,"about_ca_system_score_gemma":0.001398504,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009905019,"about_ca_topic_score_gemma":0.006629211,"domain_scores_codex":[0.9991986,0.0002793561,0.00002083856,0.00007798302,0.0002130095,0.0002102245],"domain_scores_gemma":[0.9973606,0.00154214,0.000281189,0.0002010236,0.0005269087,0.00008800718],"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.0001160563,0.00002510817,0.0004966033,0.0001335271,0.00003786491,0.0002603816,0.0001767812,0.8822433,0.004044791,0.09606541,0.001292491,0.01510774],"study_design_scores_gemma":[0.000008113917,0.00004457542,0.0001513509,0.00001685605,0.00001239414,0.00009886349,0.00004523927,0.9861332,0.000396704,0.01267219,0.0004027929,0.0000177586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1232836,0.002567954,0.8530991,0.0008082307,0.00009004971,0.0001402154,0.0003052531,0.0002571335,0.01944834],"genre_scores_gemma":[0.966329,0.001463682,0.02838464,0.0001629753,0.00008351195,0.00007938455,0.0001207081,0.0000460081,0.003330143],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009905019,"threshold_uncertainty_score":0.01969469,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08890690206518086,"score_gpt":0.3245589423044543,"score_spread":0.2356520402392734,"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."}}