{"id":"W2963652650","doi":"","title":"On the Optimality of Successive Decoding in Compress-and-Forward Relay Schemes","year":2010,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decoding methods; Relay; Encoding (memory); Computer science; Joint (building); Sequential decoding; Algorithm; List decoding; Process (computing); Block (permutation group theory); Theoretical computer science; Mathematics; Block code; Artificial intelligence; Combinatorics; Power (physics); Concatenated error correction code; Engineering","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.004628587,0.002461717,0.001776676,0.001438202,0.0009577966,0.001636584,0.001585678,0.001815019,0.003934482],"category_scores_gemma":[0.02070613,0.000813921,0.0008593308,0.001768292,0.003608968,0.003540759,0.002376892,0.00322452,0.001103271],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002863921,"about_ca_system_score_gemma":0.002325756,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002931304,"about_ca_topic_score_gemma":0.002356693,"domain_scores_codex":[0.9969206,0.001547935,0.0001159109,0.0003395333,0.000706941,0.0003691042],"domain_scores_gemma":[0.9831907,0.01434001,0.0006191778,0.0008337611,0.0008255286,0.000190795],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004537546,0.00006469318,0.0005782825,0.000362035,0.00007233659,0.0002143931,0.0004176445,0.2403139,0.004487112,0.7194212,0.004734206,0.02888043],"study_design_scores_gemma":[0.00007141314,0.000193443,0.000445618,0.0001686926,0.00004945578,0.0002221823,0.00007929752,0.5269323,0.003408016,0.4648851,0.003492287,0.00005224523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08409607,0.007323212,0.8332466,0.002855928,0.0002581123,0.0001878755,0.0008309578,0.0003605928,0.07084059],"genre_scores_gemma":[0.8523108,0.01035333,0.1229483,0.0006849337,0.0004938627,0.0003455453,0.0007055668,0.000296469,0.01186106],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004628587,"threshold_uncertainty_score":0.02447855,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07162757057344256,"score_gpt":0.2139959597698551,"score_spread":0.1423683891964125,"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."}}