{"id":"W2057153424","doi":"10.1109/netcod.2013.6570822","title":"On multiplicative matrix channels over finite chain rings","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Multiplicative function; Linear network coding; Coding (social sciences); Matrix (chemical analysis); Mathematics; Transmitter; Lattice (music); Topology (electrical circuits); Finite field; Channel capacity; Discrete mathematics; Channel (broadcasting); Generator matrix; Computer science; Algorithm; Combinatorics; Telecommunications; Decoding methods; Physics; Mathematical analysis; Computer network","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.001413504,0.000672805,0.0005790803,0.0006500144,0.0007053659,0.001135719,0.0006279567,0.0005065915,0.002035184],"category_scores_gemma":[0.00468856,0.0002621918,0.0003717703,0.0009040108,0.002207066,0.002727131,0.001493225,0.001249956,0.0003939834],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00103543,"about_ca_system_score_gemma":0.000864415,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001478515,"about_ca_topic_score_gemma":0.00114311,"domain_scores_codex":[0.99842,0.0006864038,0.00005186792,0.0001582616,0.0003963885,0.0002871531],"domain_scores_gemma":[0.9955705,0.003076698,0.0004387889,0.0004501989,0.0002980706,0.0001657763],"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.000107476,0.00003701551,0.0001684618,0.000069336,0.000008273861,0.0001434224,0.0001575358,0.1746014,0.00435081,0.8132979,0.0006760745,0.006382412],"study_design_scores_gemma":[0.00002430268,0.00006052614,0.00008764158,0.00002045563,0.000006522251,0.00007824795,0.00004070522,0.6847467,0.001983438,0.3113381,0.00158839,0.00002503327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1387995,0.000640511,0.8440515,0.0005996382,0.00009011155,0.00005853971,0.0001653764,0.0001687592,0.01542593],"genre_scores_gemma":[0.9447312,0.0009874806,0.04880386,0.0001475406,0.0002109447,0.0001350106,0.0001032534,0.00004156945,0.004839117],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002035184,"threshold_uncertainty_score":0.007512629,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02741710375886143,"score_gpt":0.2853105657450337,"score_spread":0.2578934619861723,"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."}}