{"id":"W2753952433","doi":"10.14209/jcis.2017.10","title":"On Multiplicative Matrix Channels over Finite Chain Rings","year":2017,"lang":"en","type":"article","venue":"Journal of Communication and Information Systems","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Multiplicative function; Channel (broadcasting); Coding (social sciences); Matrix (chemical analysis); Mathematics; Transmitter; Channel capacity; Linear network coding; Topology (electrical circuits); Finite field; Chain (unit); Discrete mathematics; Computer science; Telecommunications; Combinatorics; Mathematical analysis; Physics; Statistics","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.00161102,0.0007577951,0.0006985774,0.0008217515,0.0009026896,0.001184299,0.0006679075,0.000595459,0.002067391],"category_scores_gemma":[0.005553034,0.0003100847,0.0004075817,0.001132919,0.002195961,0.003027397,0.00179925,0.001232827,0.0003877606],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001069527,"about_ca_system_score_gemma":0.0008741057,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001352743,"about_ca_topic_score_gemma":0.0009711551,"domain_scores_codex":[0.9980477,0.0008325971,0.00006888554,0.0002228197,0.0004215849,0.0004064211],"domain_scores_gemma":[0.9935797,0.004444018,0.0007578897,0.0006289346,0.0003792722,0.0002101004],"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.0001779777,0.00003993504,0.0002766224,0.00009868421,0.00001285833,0.0002567426,0.0002207227,0.2125006,0.004423696,0.7719488,0.000961874,0.009081554],"study_design_scores_gemma":[0.00003042584,0.0001018842,0.0001526368,0.0000289153,0.0000123349,0.0001479006,0.00006887128,0.6842729,0.002428635,0.3105938,0.002127161,0.00003452997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1709909,0.0008088296,0.8144574,0.0006143957,0.00009733145,0.00007242751,0.0001933658,0.0001899407,0.01257544],"genre_scores_gemma":[0.9531367,0.00117951,0.04049048,0.0001537471,0.0002314471,0.0001291584,0.000126373,0.00004155317,0.004510976],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002067391,"threshold_uncertainty_score":0.008520007,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03205894422058727,"score_gpt":0.3065044624902132,"score_spread":0.2744455182696259,"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."}}