{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004528592,0.0001768422,0.000190225,0.0001371711,0.0004594357,0.0001494411,0.002243694,0.00004526047,0.000004769538],"category_scores_gemma":[0.00001475613,0.0001544681,0.00005735888,0.0002249642,0.0003024156,0.0006011026,0.000418048,0.0002194063,0.000004674989],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000534213,"about_ca_system_score_gemma":0.00007643831,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001330357,"about_ca_topic_score_gemma":0.00006096678,"domain_scores_codex":[0.9987428,0.00007521483,0.0003297124,0.0003385026,0.0001633159,0.0003504982],"domain_scores_gemma":[0.9971832,0.0003705856,0.0002278708,0.001958599,0.0001495987,0.0001101155],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002593694,0.0001690502,0.0004889613,0.00001930403,0.000140571,0.0000122582,0.002580734,0.00002167768,0.03489596,0.006770304,0.0005294746,0.9543458],"study_design_scores_gemma":[0.003056406,0.0002809531,0.0004165989,0.0001864237,0.00005808063,0.0002383497,0.001114118,0.9292408,0.05908368,0.00136226,0.003908971,0.001053396],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005256026,0.0000557556,0.9927358,0.0005395203,0.0002299698,0.0004152992,0.00004963629,0.0002006836,0.000517322],"genre_scores_gemma":[0.1540361,0.00001784042,0.8451566,0.000646399,0.00002380135,0.00007289942,0.00002250966,0.00001477494,0.000009108327],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9532924,"threshold_uncertainty_score":0.6299027,"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."}}