{"id":"W2111914658","doi":"10.1109/isit.2006.261959","title":"On Rateless Coding over Fading Channels with Delay Constraints","year":2006,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Fading; Computer science; Computer network; Channel (broadcasting); Coding (social sciences); Throughput; Wireless; Decoding methods; Algorithm; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001790926,0.0001168754,0.0001131685,0.00007774647,0.0002306732,0.0002170596,0.0005010039,0.0000279482,0.0001878076],"category_scores_gemma":[0.00000805116,0.00008884822,0.0000243367,0.0003316111,0.00006711701,0.0002522577,0.0001349131,0.0001189491,0.00004482691],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003919402,"about_ca_system_score_gemma":0.00003088398,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007273002,"about_ca_topic_score_gemma":0.00003387203,"domain_scores_codex":[0.9991896,0.00006425773,0.000138986,0.0002388266,0.0001555701,0.0002127412],"domain_scores_gemma":[0.9992753,0.0001531181,0.00004944853,0.0004027992,0.00007239139,0.00004690404],"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.000004258983,0.00003200533,0.000192197,0.000001603431,0.00000674085,0.00001179406,0.0001151467,0.002505644,0.0005879828,0.9791115,0.002000436,0.01543071],"study_design_scores_gemma":[0.003376483,0.0004328981,0.005150936,0.000438613,0.00001225665,0.000141204,0.0000988516,0.932812,0.03064485,0.01048264,0.0149377,0.001471621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04869759,0.00003753612,0.8812507,0.0004652648,0.0001256907,0.0001109002,4.082883e-7,0.0001816498,0.06913022],"genre_scores_gemma":[0.9931269,0.00002069568,0.005163315,0.0006726898,0.00004405742,0.00001398901,0.00000200115,0.000006693408,0.0009497117],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9686288,"threshold_uncertainty_score":0.3623126,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02625735555529049,"score_gpt":0.2599243375499993,"score_spread":0.2336669819947088,"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."}}