{"id":"W2796841874","doi":"10.1109/tit.2018.2873140","title":"Stopping Redundancy Hierarchy Beyond the Minimum Distance","year":2018,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Division of Mathematical Sciences; University of Illinois at Urbana-Champaign; ITMO University; University of Cambridge; Tallinna Tehnikaülikool; Tartu Ülikool; Nanyang Technological University; Belarusian State University; Saint Petersburg State University; Lunds Universitet; McGill University; Eesti Teadusagentuur; Technion-Israel Institute of Technology; University College Dublin","keywords":"Redundancy (engineering); Row; Mathematics; Code (set theory); Decoding methods; Combinatorics; Upper and lower bounds; Binary erasure channel; Discrete mathematics; Algorithm; Computer science; Coding (social sciences); Statistics; Set (abstract data type)","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00173231,0.0007703831,0.001093983,0.001710149,0.001152646,0.001571257,0.001456682,0.001444096,0.002656741],"category_scores_gemma":[0.0115506,0.0005488793,0.000688716,0.0007370608,0.002427525,0.003133164,0.002821708,0.002465917,0.0006312197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001170884,"about_ca_system_score_gemma":0.0006753445,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004730979,"about_ca_topic_score_gemma":0.0003101909,"domain_scores_codex":[0.9976266,0.0006413932,0.0001303766,0.0003104423,0.0008914663,0.0003997476],"domain_scores_gemma":[0.9891776,0.006987289,0.0009908518,0.001309271,0.0009477118,0.0005872182],"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.0002216599,0.00005512538,0.00158738,0.0002849918,0.00004433312,0.0003883567,0.0003966012,0.05341944,0.01041301,0.910331,0.002409249,0.02044891],"study_design_scores_gemma":[0.00002475271,0.0001276416,0.0009007254,0.00006661813,0.00002063379,0.0004014929,0.00006061017,0.3313244,0.004257873,0.6602789,0.002485373,0.00005078752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.5134217,0.004516392,0.4143331,0.001933986,0.000202734,0.00008662607,0.0005864261,0.0006836775,0.06423539],"genre_scores_gemma":[0.9685711,0.0007633884,0.02633583,0.0002769523,0.0001737504,0.0001091013,0.0003145085,0.0001024435,0.003353014],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.002656741,"threshold_uncertainty_score":0.009161413,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01348879551729385,"score_gpt":0.2542901375572471,"score_spread":0.2408013420399533,"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."}}