{"id":"W1967913462","doi":"10.1109/allerton.2010.5706953","title":"On the optimality of successive decoding in compress-and-forward relay schemes","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decodes; Decoding methods; Relay; Computer science; Relay channel; Joint (building); Cover (algebra); Sequential decoding; Process (computing); Algorithm; Block 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.005673829,0.003487313,0.002536299,0.002301767,0.001507273,0.002753645,0.0023064,0.002579021,0.005059607],"category_scores_gemma":[0.02987337,0.001172407,0.0013581,0.002685964,0.005277065,0.005230059,0.00347257,0.004995096,0.001582411],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00321977,"about_ca_system_score_gemma":0.002794843,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002997217,"about_ca_topic_score_gemma":0.002247025,"domain_scores_codex":[0.994751,0.002282142,0.0002493316,0.0006410897,0.001371901,0.0007044257],"domain_scores_gemma":[0.9740442,0.02162798,0.001147909,0.001360363,0.001477207,0.0003422978],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006577059,0.00009104703,0.000673346,0.0004632449,0.00008937922,0.0003812677,0.0006217792,0.210252,0.006826858,0.7445188,0.005496806,0.02992776],"study_design_scores_gemma":[0.0001074788,0.0002746881,0.00037303,0.0002503088,0.00006954156,0.0004079684,0.0001184589,0.5869004,0.005074013,0.4007891,0.00554292,0.00009213656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04257069,0.00637081,0.8911409,0.002003883,0.0003096162,0.0002172386,0.0007710647,0.0004330597,0.05618285],"genre_scores_gemma":[0.7941092,0.01395964,0.1764483,0.001053724,0.0008584756,0.0005307206,0.000874647,0.0004112474,0.01175398],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005673829,"threshold_uncertainty_score":0.03000641,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02820962458557981,"score_gpt":0.2918548188501362,"score_spread":0.2636451942645564,"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."}}