{"id":"W2021756556","doi":"10.1109/netcod.2012.6261896","title":"Gamma Codes: A low-overhead linear-complexity network coding solution","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Linear network coding; Linear code; Block code; Computer science; Decoding methods; Concatenated error correction code; Overhead (engineering); Theoretical computer science; Algorithm; Coding (social sciences); Random access; Fountain code; Encoding (memory); Mathematics; Computer network","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.0008380648,0.0011348,0.0006180156,0.0007525753,0.000445725,0.000991463,0.001237345,0.0008788468,0.002855635],"category_scores_gemma":[0.004021699,0.0003073666,0.0003502951,0.001029223,0.001177689,0.001297909,0.001672515,0.001516973,0.001135061],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001054083,"about_ca_system_score_gemma":0.001962511,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001605942,"about_ca_topic_score_gemma":0.001985963,"domain_scores_codex":[0.9992918,0.0002240506,0.00001816991,0.00007171222,0.000277848,0.0001164629],"domain_scores_gemma":[0.9988376,0.0004970333,0.0001519021,0.0001805116,0.0002665615,0.00006630268],"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.0003347159,0.00008807942,0.0003979254,0.0002194498,0.00006712587,0.0002225108,0.0001638434,0.4666163,0.01373104,0.3448212,0.01110434,0.1622335],"study_design_scores_gemma":[0.0000713439,0.0001621145,0.00009330164,0.0000640156,0.00003138462,0.0002886616,0.00003447969,0.8789874,0.006192002,0.1020208,0.01201217,0.00004225374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01030956,0.0005564775,0.9812667,0.0003665863,0.00009568632,0.00007886472,0.00011056,0.0004065172,0.006809138],"genre_scores_gemma":[0.4708794,0.002072563,0.5103965,0.0007543777,0.0002428929,0.0004857821,0.0004304675,0.0002092016,0.01452881],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002855635,"threshold_uncertainty_score":0.009553015,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1003671228356705,"score_gpt":0.3153580397686064,"score_spread":0.2149909169329358,"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."}}