{"id":"W2801400867","doi":"10.1109/tit.2019.2912165","title":"Reliable and Secure Multishot Network Coding Using Linearized Reed-Solomon Codes","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natur og Univers, Det Frie Forskningsråd","keywords":"Linear network coding; Decoding methods; Network packet; Channel code; Information-theoretic security; Secrecy; Coding (social sciences); Code (set theory); Shannon–Fano coding; Computational complexity theory","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.001224598,0.0008183658,0.0006339364,0.0006753703,0.0005206976,0.001136952,0.0009342813,0.0009159981,0.001187335],"category_scores_gemma":[0.003961897,0.0003593063,0.0004851246,0.0007296511,0.001854618,0.002086991,0.002241696,0.001367144,0.0004370337],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001261892,"about_ca_system_score_gemma":0.001105714,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001502263,"about_ca_topic_score_gemma":0.001150352,"domain_scores_codex":[0.9986151,0.0004221383,0.0000440215,0.000157866,0.000544717,0.0002160984],"domain_scores_gemma":[0.9968622,0.001723919,0.0005046845,0.0004320339,0.0003780852,0.00009903899],"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.0003278046,0.00004234065,0.0004182796,0.0001283295,0.00004170422,0.000402786,0.0002996848,0.7406043,0.02425819,0.2022968,0.001173295,0.0300064],"study_design_scores_gemma":[0.00001555209,0.00007489639,0.00006594045,0.0000216982,0.00000859243,0.00008872774,0.00003374679,0.9616247,0.005945321,0.03149979,0.0005952552,0.00002573236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06619947,0.0003016152,0.9262267,0.000326111,0.00003889581,0.00006665775,0.00009126845,0.0002973091,0.006451893],"genre_scores_gemma":[0.9398984,0.0003418965,0.05591014,0.00007069767,0.00004052016,0.0000939822,0.0001051432,0.00003300275,0.003506171],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001502263,"threshold_uncertainty_score":0.009155691,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01899466051068887,"score_gpt":0.2509348176087943,"score_spread":0.2319401570981054,"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."}}