{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007775904,0.0001482706,0.0001728215,0.000045843,0.0004771676,0.0001151152,0.0008034118,0.00005807134,0.0001905901],"category_scores_gemma":[0.00003834409,0.0001357871,0.0000700997,0.0005336537,0.00006948778,0.0007949471,0.0006377078,0.0002038226,0.0002675545],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008235934,"about_ca_system_score_gemma":0.00003812194,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001185899,"about_ca_topic_score_gemma":0.00007584739,"domain_scores_codex":[0.9985605,0.0002074424,0.000255974,0.0002243923,0.0002012456,0.0005504033],"domain_scores_gemma":[0.9987391,0.000162533,0.00008249123,0.0007294022,0.0001095431,0.000176905],"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.000009327749,0.0001596375,0.003890483,0.00001203329,0.00002286834,8.890888e-7,0.001069714,0.0004012581,0.0009771693,0.904215,0.03310833,0.0561333],"study_design_scores_gemma":[0.0004857857,0.00004581481,0.01412265,0.00009444836,0.000007798798,0.00002141661,0.00003156202,0.9067386,0.001067754,0.001605399,0.07529114,0.0004875658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003840406,0.0007950356,0.9705853,0.001456815,0.000476225,0.0001567695,6.616438e-7,0.0003650654,0.02232368],"genre_scores_gemma":[0.8867581,0.0003717946,0.1102478,0.001472578,0.0004670707,0.0000141689,0.000006595613,0.000008396398,0.0006534529],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9063374,"threshold_uncertainty_score":0.5537237,"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."}}