{"id":"W2139416652","doi":"10.1109/tit.2008.926449","title":"Coding for Errors and Erasures in Random Network Coding","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1097,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Grassmannian; Decoding methods; Mathematics; Code word; Discrete mathematics; List decoding; Linear network coding; Vector space; Coding theory; Linear space; Linear code; Combinatorics; Algorithm; Concatenated error correction code; Block code; Computer science; Network packet; Pure 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.001661252,0.0008739688,0.0007381784,0.001471281,0.0005391835,0.001745466,0.0009437267,0.001284145,0.004493527],"category_scores_gemma":[0.007049445,0.0003466424,0.0007320474,0.001714451,0.00209363,0.00309446,0.00185729,0.002442195,0.001187225],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001563556,"about_ca_system_score_gemma":0.001059126,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001827073,"about_ca_topic_score_gemma":0.00193304,"domain_scores_codex":[0.9983529,0.0007923855,0.00007577616,0.0001752835,0.0004424507,0.0001611403],"domain_scores_gemma":[0.9979328,0.001231971,0.0001561865,0.0003692134,0.0002626042,0.00004724845],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001651269,0.00000380382,0.00005409436,0.00004852882,0.000006041212,0.00004618365,0.00006071665,0.0141986,0.0003956045,0.9725395,0.002535046,0.01009535],"study_design_scores_gemma":[0.00000910302,0.00001681552,0.00008477479,0.00005365169,0.000005926222,0.00007531574,0.00002874609,0.1083959,0.000559911,0.8794436,0.01131031,0.00001605212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01472275,0.008220453,0.9314009,0.003517571,0.0008792485,0.00008226664,0.0003858763,0.0003460857,0.04044484],"genre_scores_gemma":[0.6451675,0.01767828,0.2821653,0.001868574,0.002502647,0.0008462778,0.001342495,0.0004471491,0.04798176],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004493527,"threshold_uncertainty_score":0.01503235,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02987853723354601,"score_gpt":0.2569482130286362,"score_spread":0.2270696757950902,"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."}}