{"id":"W2153854069","doi":"10.1109/wimob.2008.24","title":"Throughput and Performance Optimization Using an Adaptive Coded Cooperation Protocol","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Throughput; Computer network; Automatic repeat request; Channel (broadcasting); Redundancy (engineering); Coding (social sciences); Decoding methods; Spectral efficiency; MIMO; Convolutional code; Hybrid automatic repeat request; Algorithm; Wireless; Telecommunications; Telecommunications link","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.001788333,0.0007380754,0.0003992401,0.0007719241,0.0004094467,0.0008694354,0.0007610712,0.0005813409,0.0006027084],"category_scores_gemma":[0.00450777,0.0001629507,0.0002744939,0.0009407059,0.0009723902,0.0006784116,0.0008291443,0.0004904495,0.00009469873],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001395153,"about_ca_system_score_gemma":0.001312156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002702079,"about_ca_topic_score_gemma":0.002191414,"domain_scores_codex":[0.9988951,0.0004387689,0.00003512087,0.0001117839,0.0003319387,0.0001872658],"domain_scores_gemma":[0.9972913,0.001698631,0.0002165475,0.0002706782,0.0004441212,0.00007873332],"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.0003089444,0.000106349,0.0008032981,0.00005673415,0.00004226466,0.0002435731,0.0001137257,0.90864,0.02674661,0.02973817,0.0008051523,0.0323951],"study_design_scores_gemma":[0.00001262234,0.00009994528,0.0001836887,0.000003131392,0.00001453616,0.00005506973,0.0000147555,0.9910163,0.005320691,0.00302586,0.0002419298,0.00001154205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3898456,0.0006050912,0.593846,0.0004292279,0.00005310058,0.0001710386,0.0001062815,0.0005963501,0.01434737],"genre_scores_gemma":[0.9817191,0.0000905624,0.01732516,0.00001335151,0.00000859078,0.00004584614,0.00002390191,0.00001248823,0.0007610922],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002702079,"threshold_uncertainty_score":0.0101226,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1219503043937638,"score_gpt":0.3173284920965901,"score_spread":0.1953781877028263,"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."}}