{"id":"W2062038811","doi":"10.1109/isbmsb.2010.5463163","title":"Optimization of rateless coding for multimedia multicasting","year":2010,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Fountain code; Computer science; Erasure; Online codes; Multicast; Decoding methods; Raptor code; Luby transform code; Erasure code; Coding (social sciences); Forward error correction; Computer network; Quality of service; Computer engineering; Algorithm; Block code; Concatenated error correction code","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.0003630363,0.00006654578,0.0001000352,0.00007669655,0.00005464064,0.00003549698,0.0004066988,0.00005215995,0.000009066105],"category_scores_gemma":[0.0006238217,0.00006169759,0.00003419778,0.0001589876,0.00002380226,0.0002277974,0.000102692,0.00009267338,0.000001231665],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000684862,"about_ca_system_score_gemma":0.00002433131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002063899,"about_ca_topic_score_gemma":0.00001986986,"domain_scores_codex":[0.9993908,0.00001234066,0.0001800175,0.0001828821,0.00009729013,0.000136706],"domain_scores_gemma":[0.9990006,0.0003813167,0.0001009525,0.0002689206,0.0002142619,0.00003393331],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001534288,0.000168321,0.002971004,0.0001135227,0.00001825069,0.000002398573,0.002522117,0.01499557,0.6446298,0.0630281,0.0005349846,0.2710005],"study_design_scores_gemma":[0.000109021,0.0000207495,0.00005465789,0.000009436514,0.000001482056,0.000002429672,0.00001355977,0.7860611,0.2134971,0.0001440385,0.00002591954,0.00006049414],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01432071,0.000001414479,0.9834493,0.00008543824,0.0004468852,0.0002104346,5.651133e-7,0.00043566,0.001049569],"genre_scores_gemma":[0.4637346,3.313997e-7,0.5361826,0.0000159158,0.00001907266,0.00001083951,5.945491e-7,0.000004335758,0.00003163586],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7710655,"threshold_uncertainty_score":0.2515954,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02383862625995316,"score_gpt":0.2923811090237147,"score_spread":0.2685424827637616,"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."}}