{"id":"W2100525102","doi":"10.1109/tit.2009.2018350","title":"Braided Block Codes","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":95,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"National Aeronautics and Space Administration; National Science Foundation","keywords":"Block code; Concatenated error correction code; Linear code; Expander code; Computer science; Decoding methods; Serial concatenated convolutional codes; Convolutional code; Tornado code; Block (permutation group theory); Sequential decoding; Theoretical computer science; Algorithm; Mathematics; Combinatorics","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.0004903253,0.000135053,0.0001118034,0.0003267001,0.0002266416,0.0001558955,0.000525316,0.00007948111,0.00002924097],"category_scores_gemma":[0.00001703283,0.0001313453,0.00008564612,0.0003994885,0.00002849785,0.00228911,0.000001398228,0.0002343467,0.0003220407],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000065051,"about_ca_system_score_gemma":0.00004449879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005023741,"about_ca_topic_score_gemma":0.000002287358,"domain_scores_codex":[0.9990503,0.00008315925,0.0003068236,0.0001254023,0.0002424479,0.0001918532],"domain_scores_gemma":[0.9990649,0.0001596405,0.000108537,0.0004975764,0.0001042291,0.00006517967],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00005636815,0.0001312368,0.000001697903,0.00001253652,0.0000211685,0.000001637162,0.004560221,0.007823833,0.0008632194,0.1685925,0.001565256,0.8163703],"study_design_scores_gemma":[0.001298317,0.001260098,0.0004734843,0.0001777594,0.00003850068,0.0002191609,0.0005275774,0.1153206,0.6442378,0.2247241,0.01048103,0.001241603],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002179663,0.000004897796,0.9806467,0.0005637471,0.0004706374,0.0001761866,0.00000381113,0.001460941,0.01449339],"genre_scores_gemma":[0.9769516,0.000008242445,0.02019461,0.002538383,0.00001368716,0.00001975181,0.000001071919,0.000004107558,0.0002685392],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9747719,"threshold_uncertainty_score":0.5356105,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009182243179655785,"score_gpt":0.2404326014872944,"score_spread":0.2312503583076386,"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."}}