{"id":"W2069794613","doi":"10.1109/lcomm.2012.011312.112462","title":"Decode-Compress-and-Forward with Selective-Cooperation for Relay Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Relay; Computer science; Block Error Rate; Decoding methods; Transmission (telecommunications); Relay channel; Coding (social sciences); Algorithm; Computer network; Real-time computing; Telecommunications link; Telecommunications; Mathematics; Statistics","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.0009925555,0.0007755713,0.0005169095,0.00052361,0.000564778,0.0004972793,0.001037281,0.0006652343,0.0008815948],"category_scores_gemma":[0.001579724,0.0002133448,0.000368919,0.0005232782,0.0008113536,0.0009042476,0.0007207924,0.0004794686,0.0002884607],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005518805,"about_ca_system_score_gemma":0.0007955586,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001606905,"about_ca_topic_score_gemma":0.003075979,"domain_scores_codex":[0.9995472,0.0001801575,0.00002306985,0.00004941241,0.0001476055,0.00005245697],"domain_scores_gemma":[0.9990768,0.0004760931,0.0001038929,0.0001626359,0.0001537374,0.00002675834],"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.0004605636,0.000110656,0.001092764,0.0003283896,0.0001060353,0.0006527607,0.0004066956,0.6682326,0.05397641,0.1122837,0.002659113,0.1596903],"study_design_scores_gemma":[0.00004336111,0.0002206612,0.0001371118,0.00001408693,0.00003637792,0.0003474479,0.00002747173,0.9667597,0.01348391,0.01597643,0.002924232,0.00002913083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04453147,0.001257801,0.9506287,0.0002395475,0.00004573885,0.00008003331,0.00006477686,0.0002875409,0.002864268],"genre_scores_gemma":[0.8244966,0.001008604,0.1723175,0.00009981927,0.00004710355,0.0001380516,0.00007307238,0.00001822061,0.00180114],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001606905,"threshold_uncertainty_score":0.005249202,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03800262803668755,"score_gpt":0.2854847177944032,"score_spread":0.2474820897577157,"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."}}