{"id":"W2023544465","doi":"10.1109/tcomm.2011.091911.100189","title":"Binary Soliton-Like Rateless Coding for the Y-Network","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Fountain code; Computer science; Luby transform code; Linear network coding; Decoding methods; Binary erasure channel; Computer network; Binary number; Variable-length code; Coding (social sciences); Theoretical computer science; Algorithm; Block code; Linear code; Channel (broadcasting); Channel capacity; 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.0007125007,0.0002678322,0.0002577345,0.0003471387,0.0003897523,0.000609691,0.0004664217,0.0004373348,0.0008655447],"category_scores_gemma":[0.002164378,0.0001037041,0.000196526,0.000441481,0.0007477711,0.0009868112,0.0005812143,0.0005835042,0.0002105766],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007349997,"about_ca_system_score_gemma":0.0008539578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001618162,"about_ca_topic_score_gemma":0.001408533,"domain_scores_codex":[0.9997897,0.00008111489,0.000007855176,0.00001991316,0.00007087264,0.0000305763],"domain_scores_gemma":[0.9989901,0.0004846149,0.0002045664,0.0001442107,0.0001514243,0.000024921],"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.0003830639,0.00007575268,0.0006942182,0.0002462217,0.00004076842,0.0002684247,0.0002833727,0.335774,0.06046512,0.4945534,0.002389452,0.1048262],"study_design_scores_gemma":[0.00002337798,0.0001187849,0.0001771338,0.00002844282,0.00001226097,0.000141491,0.00003368687,0.9386513,0.017075,0.04002688,0.003688317,0.00002337348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05137305,0.0005616783,0.9428514,0.0003558008,0.00004266486,0.00004858754,0.00003954368,0.0002185129,0.004508768],"genre_scores_gemma":[0.8598377,0.0007114296,0.1356715,0.0001590247,0.00003309406,0.0001209412,0.00005912142,0.00003300502,0.003374254],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001618162,"threshold_uncertainty_score":0.005332828,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1408034872508833,"score_gpt":0.3115664331947468,"score_spread":0.1707629459438635,"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."}}