{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004140848,0.0001642245,0.0001542553,0.0002609217,0.0001206512,0.00008173917,0.000274294,0.0001226789,0.00005089747],"category_scores_gemma":[0.00001753843,0.0001679254,0.00008014592,0.0001778396,0.00003886163,0.0009742918,0.000001385208,0.0002017746,0.0000679971],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001337546,"about_ca_system_score_gemma":0.00004914578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005973291,"about_ca_topic_score_gemma":0.000006604735,"domain_scores_codex":[0.9991996,0.00004300184,0.0003349141,0.00006792748,0.0001738879,0.0001806867],"domain_scores_gemma":[0.9991143,0.000195328,0.00006188813,0.0003683167,0.0001305903,0.0001296146],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003215526,0.00004409856,9.794787e-7,0.0002025934,0.0001955018,2.030065e-7,0.01910319,0.5064348,0.0008910409,0.2558975,0.008427268,0.2084813],"study_design_scores_gemma":[0.002935112,0.0002629774,0.00002237921,0.0001839684,0.00009379705,0.00002754271,0.003821068,0.3756087,0.3515119,0.2425742,0.02194186,0.001016481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00103972,0.00003497463,0.9923639,0.00007320566,0.0005555547,0.0004498904,0.00008052355,0.001062163,0.004340108],"genre_scores_gemma":[0.990245,0.00004722617,0.009225614,0.0001599032,0.00003725702,0.0001352119,0.00003345057,0.00002701601,0.00008927658],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9892053,"threshold_uncertainty_score":0.6847799,"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."}}