{"id":"W1991684514","doi":"10.1109/itw.2013.6691229","title":"Source broadcasting over erasure channels: Distortion bounds and code design","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Binary erasure channel; Erasure code; Erasure; Broadcasting (networking); Computer network; Decoding methods; Source code; Latency (audio); Channel (broadcasting); Fountain code; Linear network coding; Lossy compression; Channel code; Coding (social sciences); Theoretical computer science; Algorithm; Channel capacity; Telecommunications; Linear code; Block code; Mathematics; Network packet","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.002632466,0.001010306,0.0008654362,0.001055813,0.0005378838,0.001718807,0.001276789,0.001180653,0.00209729],"category_scores_gemma":[0.01560176,0.0004770283,0.0004591059,0.001303179,0.001915095,0.002567892,0.001744208,0.001564075,0.000372038],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002630898,"about_ca_system_score_gemma":0.001562914,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00351731,"about_ca_topic_score_gemma":0.002030758,"domain_scores_codex":[0.9987632,0.000465129,0.00003093392,0.00009534873,0.0004715886,0.0001738098],"domain_scores_gemma":[0.9859299,0.01153344,0.0008472539,0.0005118796,0.0009509426,0.0002264936],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008239678,0.00004143028,0.0003535273,0.00009432497,0.00001981374,0.00005905267,0.0001104125,0.8874705,0.002256833,0.09858772,0.0008355195,0.01008856],"study_design_scores_gemma":[0.00001090224,0.0000260862,0.00007717955,0.00001344945,0.000005691511,0.00003545206,0.00002766439,0.975044,0.001110181,0.02322621,0.0004142766,0.000008883646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04721089,0.002096152,0.9389458,0.0007571544,0.00005473333,0.00006423322,0.0001210013,0.0001843308,0.01056565],"genre_scores_gemma":[0.8754274,0.00316301,0.1150315,0.0001581992,0.0001126338,0.0002112225,0.0001725882,0.0001863324,0.005537176],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00351731,"threshold_uncertainty_score":0.01908863,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05347429161299735,"score_gpt":0.2609578469817037,"score_spread":0.2074835553687064,"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."}}