{"id":"W2058891692","doi":"10.1109/itwksps.2010.5503160","title":"Optimality of subspace coding for linear operator channels over finite fields","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Linear map; Subspace topology; Linear network coding; Upper and lower bounds; Mathematics; Coding (social sciences); Algorithm; Finite field; Computer science; Topology (electrical circuits); Discrete mathematics; Combinatorics; Mathematical analysis; Statistics; 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.003101657,0.000933509,0.00109061,0.0007462145,0.0006019705,0.00130083,0.0007444282,0.0007878746,0.001794547],"category_scores_gemma":[0.01334101,0.0003920805,0.0004144457,0.0009934797,0.002816366,0.00291626,0.00189709,0.001577828,0.0003467308],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001632722,"about_ca_system_score_gemma":0.001633871,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00176822,"about_ca_topic_score_gemma":0.001084062,"domain_scores_codex":[0.997563,0.001293499,0.00008195944,0.0002099767,0.0004128835,0.0004387456],"domain_scores_gemma":[0.9840522,0.01319216,0.0008723586,0.0008118445,0.0007505245,0.0003209601],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002718193,0.00005234472,0.0004156696,0.0001063549,0.00002367866,0.00009898728,0.0001678152,0.5635513,0.003323429,0.4192549,0.001766821,0.01096686],"study_design_scores_gemma":[0.00002661365,0.00005183129,0.0001164375,0.00001814455,0.000005054043,0.00003334373,0.00003598749,0.799309,0.001260242,0.1987151,0.0004118747,0.0000163537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.200923,0.0009095161,0.7800786,0.001343009,0.00006004947,0.00006925878,0.0003968394,0.0002108195,0.01600907],"genre_scores_gemma":[0.9639645,0.0008833589,0.03160704,0.0001583804,0.0001160454,0.0001370093,0.0002773096,0.00007010201,0.00278618],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003101657,"threshold_uncertainty_score":0.01640338,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05048610128521687,"score_gpt":0.322071999761385,"score_spread":0.2715858984761682,"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."}}