{"id":"W1560541233","doi":"10.1109/tit.2015.2449852","title":"New Nonasymptotic Channel Coding Theorems for Structured Codes","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Low-density parity-check code; Mathematics; Equipartition theorem; Coding (social sciences); Discrete mathematics; Block code; Combinatorics; Decoding methods; Algorithm; Statistics; Physics","routes":{"ca_aff":true,"ca_fund":true,"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.004856876,0.001541883,0.0007562826,0.002416704,0.0008966659,0.002563609,0.001778149,0.001420627,0.003779027],"category_scores_gemma":[0.02150597,0.0006085177,0.001118075,0.001026329,0.00388587,0.004653913,0.002705007,0.004110575,0.001038593],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002117264,"about_ca_system_score_gemma":0.001782623,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004350546,"about_ca_topic_score_gemma":0.0004698986,"domain_scores_codex":[0.9975532,0.0006762542,0.0001146468,0.0002562819,0.001180046,0.0002196781],"domain_scores_gemma":[0.9832695,0.01188276,0.001162573,0.00151705,0.001843223,0.0003249792],"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.00003541783,0.00002522908,0.0001863048,0.0001024034,0.00001872997,0.00009343093,0.0001129465,0.03979787,0.002667524,0.9439985,0.001570044,0.01139166],"study_design_scores_gemma":[0.0000212291,0.00007314677,0.0001512751,0.0000692125,0.00001432447,0.0002596852,0.00003854718,0.3113366,0.005355535,0.6800211,0.002607655,0.00005161667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01121301,0.0005541691,0.9747362,0.0004790412,0.0001180295,0.00006202557,0.0001648176,0.0001579716,0.01251479],"genre_scores_gemma":[0.6506101,0.003158169,0.3338913,0.001385443,0.0007214203,0.0007916398,0.0006841643,0.0002772373,0.00848043],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004856876,"threshold_uncertainty_score":0.02568591,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01876521596735607,"score_gpt":0.2402054421471271,"score_spread":0.2214402261797711,"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."}}