{"id":"W2043454408","doi":"10.1109/cwit.2013.6621613","title":"An efficient Soliton-like network coding protocol for the resource-constrained Y-network","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Linear network coding; Fountain code; Computer science; Relay; Binary erasure channel; Computer network; Decoding methods; Coding (social sciences); Erasure; Erasure code; Luby transform code; Theoretical computer science; Distributed computing; Algorithm; Channel (broadcasting); Channel capacity; Block code; Network packet; Concatenated error correction code; Mathematics","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.0009494106,0.000385348,0.000387175,0.0004883396,0.0005510466,0.0005217039,0.0008158272,0.0005963302,0.0009711384],"category_scores_gemma":[0.002346862,0.0001357963,0.0002885649,0.0007513876,0.0008282769,0.001047825,0.001295262,0.0006494187,0.0001912106],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007228702,"about_ca_system_score_gemma":0.001133929,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001899086,"about_ca_topic_score_gemma":0.00251354,"domain_scores_codex":[0.9996163,0.0001558802,0.00001931589,0.00004245626,0.0001145488,0.00005159739],"domain_scores_gemma":[0.9992162,0.0003607221,0.0001333158,0.0001011346,0.0001513762,0.00003721852],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004549453,0.0001069724,0.0004336894,0.0002516926,0.00007355817,0.0004827662,0.0005509988,0.4243755,0.05497001,0.3543521,0.007257405,0.1566903],"study_design_scores_gemma":[0.00004281686,0.0001336496,0.00008794125,0.00001712066,0.00001448916,0.0001982246,0.00003709783,0.9608197,0.009669757,0.02368204,0.005266278,0.00003090124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01500519,0.0001968112,0.981646,0.0002628306,0.00004238054,0.00008969264,0.00003291942,0.0001877737,0.002536407],"genre_scores_gemma":[0.6603181,0.0006067285,0.3322436,0.0003710209,0.00004011988,0.0004643975,0.0001483266,0.00005523944,0.005752482],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001899086,"threshold_uncertainty_score":0.005244792,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04837437440578336,"score_gpt":0.3170377769923473,"score_spread":0.268663402586564,"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."}}