{"id":"W2749637736","doi":"10.1109/access.2017.2741972","title":"On Design and Efficient Decoding of Sparse Random Linear Network Codes","year":2017,"lang":"en","type":"article","venue":"IEEE Access","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"Gruppo Nazionale per il Calcolo Scientifico; Nantong University; National Natural Science Foundation of China","keywords":"Linear network coding; Decoding methods; Computer science; Network packet; Overhead (engineering); Coding (social sciences); Algorithm; Code (set theory); Theoretical computer science; Computer network; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007960477,0.0007234904,0.0005009149,0.0005808056,0.0003081106,0.0006860014,0.0006262407,0.0006100121,0.001279852],"category_scores_gemma":[0.004428214,0.0003168118,0.0003321467,0.0007312034,0.0006199577,0.0008327708,0.0008200653,0.000785995,0.0006636376],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007997779,"about_ca_system_score_gemma":0.001476153,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001911664,"about_ca_topic_score_gemma":0.002989398,"domain_scores_codex":[0.9990501,0.0003061948,0.00004208442,0.0001072249,0.0003863215,0.0001080694],"domain_scores_gemma":[0.9982015,0.0009592456,0.0002007421,0.0001684276,0.000427838,0.00004223568],"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.0001064999,0.00004312275,0.0004985969,0.0001325632,0.00002826191,0.0001047899,0.0001244955,0.8195915,0.01383295,0.06487884,0.001922149,0.0987362],"study_design_scores_gemma":[0.0000124328,0.00005457653,0.00004369201,0.00001201907,0.000004787472,0.00004590146,0.000009163183,0.9869896,0.003768423,0.007516393,0.001536426,0.000006655596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007947905,0.0001687123,0.9888886,0.0001037823,0.00002308153,0.00004864006,0.00003844613,0.0001907825,0.002590128],"genre_scores_gemma":[0.4075986,0.0008810563,0.5848807,0.000205262,0.00009273808,0.0003390209,0.0003896849,0.0001180799,0.005494927],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001911664,"threshold_uncertainty_score":0.00580281,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.113287726888919,"score_gpt":0.3560584603076088,"score_spread":0.2427707334186898,"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."}}