{"id":"W2102292102","doi":"10.1109/lcomm.2011.011811.102279","title":"Improved Algorithm for Constructing Constrained Codes with State-Independent Decoding","year":2011,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Decoding methods; Computer science; Algorithm; Sequential decoding; BCJR algorithm; Sequence (biology); State (computer science); List decoding; Berlekamp–Welch algorithm; Block code; Concatenated error correction code","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008080751,0.0009704753,0.0006762897,0.001047349,0.000606087,0.0007452065,0.001013477,0.00105978,0.003590343],"category_scores_gemma":[0.004012755,0.0003743598,0.0006008281,0.00106399,0.0007176607,0.001218691,0.001742494,0.001740362,0.001499046],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000582544,"about_ca_system_score_gemma":0.00183624,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001514194,"about_ca_topic_score_gemma":0.002290996,"domain_scores_codex":[0.9990425,0.0002036507,0.0000738768,0.0001431289,0.0004651438,0.00007170389],"domain_scores_gemma":[0.9983909,0.0006895515,0.00008637188,0.0003370707,0.000450111,0.00004597814],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003242205,0.0001621106,0.0007319899,0.0002787451,0.00009039196,0.0002967093,0.0002921015,0.1984067,0.05004801,0.1989854,0.0072271,0.5431565],"study_design_scores_gemma":[0.0001316826,0.0001218787,0.0002843535,0.00005389398,0.00004204748,0.0003874997,0.00003145095,0.8526833,0.04971107,0.0768699,0.01959132,0.00009166259],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002965309,0.00005616528,0.9949969,0.00006157406,0.00002595349,0.00005107756,0.00005636822,0.00034508,0.001441562],"genre_scores_gemma":[0.04730563,0.0001330929,0.9494247,0.00008816555,0.00002531822,0.000205029,0.0002976745,0.0001387966,0.002381499],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003590343,"threshold_uncertainty_score":0.01201087,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04387124985788549,"score_gpt":0.2680957730262286,"score_spread":0.2242245231683431,"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."}}