{"id":"W2763550211","doi":"10.1016/j.jalgebra.2018.02.005","title":"Skew and linearized Reed–Solomon codes and maximum sum rank distance codes over any division ring","year":2018,"lang":"en","type":"preprint","venue":"Journal of Algebra","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"Danmarks Frie Forskningsfond","keywords":"Mathematics; Reed–Solomon error correction; Skew; Hamming distance; Coding theory; Discrete mathematics; Reed–Muller code; Rank (graph theory); Linear code; Block code; Hamming code; Linear network coding; Expander code; Combinatorics; Algorithm; Decoding methods; Computer science; Telecommunications","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001273828,0.0002577444,0.0005709874,0.0001957278,0.0002723876,0.000645793,0.001022953,0.0001635631,0.0000169579],"category_scores_gemma":[0.0001778134,0.0002202614,0.0001116397,0.0001834952,0.0001888965,0.0004441418,0.002339854,0.0008301068,0.000002116966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006247836,"about_ca_system_score_gemma":0.0001056493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008432992,"about_ca_topic_score_gemma":0.00003366419,"domain_scores_codex":[0.9981081,0.0002887391,0.0006454343,0.0003591715,0.0003645559,0.0002339896],"domain_scores_gemma":[0.9976963,0.0003157092,0.0007484856,0.0006636933,0.0003940107,0.0001818368],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001264974,0.001035174,0.07598489,0.00152606,0.001835829,0.0004163124,0.02232813,0.000758392,0.02463094,0.0728916,0.01094719,0.7863805],"study_design_scores_gemma":[0.01016527,0.001401755,0.3257822,0.01260795,0.000355385,0.0006311001,0.0001715544,0.5170399,0.007648792,0.08756937,0.03343946,0.003187256],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4689479,0.01365499,0.5146064,0.001396229,0.0007502756,0.0001812422,0.000006576045,0.00004698296,0.0004094266],"genre_scores_gemma":[0.9466418,0.0205451,0.03228024,0.0001984097,0.0002522461,0.00000249974,0.000002889122,0.00001598041,0.00006083192],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7831932,"threshold_uncertainty_score":0.8982,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0279234891158574,"score_gpt":0.2910732230441835,"score_spread":0.2631497339283261,"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."}}