{"id":"W2578635061","doi":"10.1109/icsae.2016.7810225","title":"Rank deficient decoding for arithmetic subspace network coding","year":2016,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Linear network coding; Decoding methods; Subspace topology; Computer science; Algorithm; List decoding; Coding (social sciences); Theoretical computer science; Linear subspace; Arithmetic; Mathematics; Computer network; Artificial intelligence; Block code; Statistics; Concatenated error correction code","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.001196667,0.0007437798,0.0005594582,0.0006093529,0.0004369234,0.0008970961,0.0006298174,0.0008942305,0.002786508],"category_scores_gemma":[0.004885002,0.0001961228,0.0004193689,0.0009803585,0.001177698,0.001684649,0.00100654,0.001268736,0.000920929],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001093243,"about_ca_system_score_gemma":0.001716073,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002936317,"about_ca_topic_score_gemma":0.002590873,"domain_scores_codex":[0.9990811,0.000388609,0.00003451401,0.0000988636,0.0002977405,0.00009912257],"domain_scores_gemma":[0.998449,0.0008895853,0.0001175202,0.0002024291,0.0003046106,0.00003690025],"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.0001004508,0.00002578672,0.0002498233,0.00007871398,0.00001604377,0.00007617311,0.0001039183,0.4439499,0.003830868,0.4869895,0.003033339,0.06154545],"study_design_scores_gemma":[0.000006850805,0.00002037817,0.00002466481,0.000008100739,0.000002254399,0.00003914735,0.000008720646,0.9359447,0.00120558,0.06133931,0.001390468,0.000009827485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005740588,0.0001739088,0.988745,0.000196373,0.00003089846,0.00002672911,0.00008967202,0.0001314761,0.004865297],"genre_scores_gemma":[0.4764766,0.001063103,0.5102712,0.0003612573,0.0001726541,0.000234211,0.0005561293,0.0001196193,0.01074525],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002936317,"threshold_uncertainty_score":0.009321809,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04708979387768664,"score_gpt":0.2866412062924246,"score_spread":0.2395514124147379,"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."}}