{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008280659,0.0001137179,0.000147042,0.0002091591,0.0006317331,0.0000817312,0.0002730033,0.00005317134,0.00001667139],"category_scores_gemma":[0.00002450026,0.0001113023,0.00005363997,0.0003629795,0.00006286569,0.001379083,0.000004761314,0.0001787458,0.00001312163],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004741268,"about_ca_system_score_gemma":0.00004985033,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000017945,"about_ca_topic_score_gemma":0.00001470912,"domain_scores_codex":[0.9990949,0.0001449011,0.0003375465,0.000112145,0.000117636,0.0001928964],"domain_scores_gemma":[0.998881,0.0006320137,0.00008806521,0.0002626699,0.00008382021,0.00005245393],"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.0005339042,0.00009762297,0.00007983009,0.0000586293,0.0000624484,0.000001692286,0.0212485,0.1556764,0.000190817,0.4201179,0.001442068,0.4004903],"study_design_scores_gemma":[0.008771189,0.0002511142,0.001598393,0.00032484,0.00002263792,0.00008691279,0.0006806886,0.9535387,0.0051784,0.01088507,0.01781376,0.0008483347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003606776,0.0000922399,0.9937153,0.0002925744,0.0003424683,0.0003444813,0.000003243543,0.0001139699,0.001488877],"genre_scores_gemma":[0.9903024,0.0009956417,0.007742696,0.0007286435,0.00002126835,0.0001079082,0.000002613772,0.000005082616,0.00009369409],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9866956,"threshold_uncertainty_score":0.4858844,"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."}}