{"id":"W2122036794","doi":"10.1109/isit.2012.6284659","title":"New constructions of codes for asymmetric channels via concatenation","year":2012,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Guelph","funders":"","keywords":"Linear code; Concatenation (mathematics); Block code; Concatenated error correction code; Reed–Muller code; Mathematics; Expander code; Discrete mathematics; Computer science; Algorithm; Combinatorics; Decoding methods","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.0002315587,0.000048358,0.00007725735,0.0001991042,0.00005861398,0.00002071886,0.0001990539,0.00002701926,0.00002642431],"category_scores_gemma":[0.0000305865,0.00004190636,0.00006164883,0.000589052,0.00002676564,0.0003380566,0.0000354527,0.00002232088,0.000005424284],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005775712,"about_ca_system_score_gemma":0.00001854696,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001429411,"about_ca_topic_score_gemma":0.000001081332,"domain_scores_codex":[0.9995776,0.00001846845,0.0001108396,0.00008575803,0.00007189481,0.0001354364],"domain_scores_gemma":[0.9995185,0.0001514581,0.0000451732,0.0001481118,0.00006928499,0.00006743707],"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.000002358347,0.00001905086,0.0005071563,0.0000042979,0.00001120766,1.240357e-8,0.0001500009,0.00001033323,0.0006455146,0.8982115,0.0006034273,0.09983518],"study_design_scores_gemma":[0.001791501,0.000464504,0.005622524,0.00002570005,0.00006463959,0.00005467259,0.000227913,0.0402921,0.2684247,0.6620963,0.02037529,0.000560079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003605725,0.00008667915,0.9918715,0.0001641512,0.0006511103,0.0001085523,0.000001396021,0.00007352943,0.003437387],"genre_scores_gemma":[0.8845053,0.000002338998,0.1151929,0.00005396483,0.00007682505,0.0000066572,0.000001082138,0.000002064015,0.0001589152],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8808995,"threshold_uncertainty_score":0.1708892,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02053811153360182,"score_gpt":0.2549883102099019,"score_spread":0.2344501986763,"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."}}