{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006982447,0.0000953093,0.0001801352,0.0000421802,0.0005884752,0.0003792591,0.001717841,0.00003119803,0.000006920307],"category_scores_gemma":[0.0001336584,0.00008126842,0.00003083526,0.00009970345,0.00008897211,0.0002740961,0.0004858257,0.00009936349,0.00000554057],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001121599,"about_ca_system_score_gemma":0.00002620394,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006092664,"about_ca_topic_score_gemma":0.00001096817,"domain_scores_codex":[0.9991727,0.0001498897,0.0001766661,0.0002082981,0.0001290767,0.0001633058],"domain_scores_gemma":[0.9981969,0.000534243,0.000186492,0.000936448,0.00008862865,0.00005728062],"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.0002922559,0.0002093552,0.004296442,0.00003541869,0.00007948278,0.00001715971,0.001102228,0.7026989,0.001938541,0.06746732,0.007656457,0.2142065],"study_design_scores_gemma":[0.0009636846,0.00004679555,0.002704568,0.0001322539,0.000005747696,0.000002066584,0.000001620453,0.9871908,0.007338491,0.001055142,0.0004274965,0.0001313176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1096924,0.0003165558,0.8881114,0.0003812885,0.0003610948,0.0001858618,3.608276e-7,0.00003581339,0.0009153048],"genre_scores_gemma":[0.9831667,0.0004657465,0.01606558,0.0001700626,0.00007219228,0.000009767638,2.455212e-7,0.000005332643,0.0000443585],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8734744,"threshold_uncertainty_score":0.4526135,"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."}}