{"id":"W1998457119","doi":"10.1109/icc.2004.1312548","title":"Fast length-constrained MAP decoding of variable length coded Markov sequences over noisy channel","year":2004,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Decoding methods; Sequential decoding; List decoding; Algorithm; Markov chain; Directed acyclic graph; Sequence (biology); Mathematics; Parameterized complexity; Markov process; Computer science; Heuristic; Constraint (computer-aided design); Mathematical optimization; Concatenated error correction code; Block 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007741947,0.0002699197,0.0003545488,0.0002390487,0.0001480871,0.0001157581,0.001298549,0.0001422178,0.0000841742],"category_scores_gemma":[0.0001376293,0.00025012,0.0001067849,0.0006167007,0.000138727,0.0007947519,0.0003793385,0.0002465639,0.00002198093],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001426419,"about_ca_system_score_gemma":0.0002689575,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009766198,"about_ca_topic_score_gemma":0.0001444533,"domain_scores_codex":[0.9979182,0.00006970685,0.0004875065,0.0005958771,0.0004196719,0.0005090761],"domain_scores_gemma":[0.998521,0.0002032195,0.0002394327,0.0007429681,0.0001748147,0.0001185161],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00005659466,0.0006413881,0.002276809,0.0003480706,0.0002140711,0.000114645,0.006726749,0.004199765,0.1237871,0.8227423,0.003017667,0.03587477],"study_design_scores_gemma":[0.002955239,0.0009759842,0.001086696,0.001025213,0.00006230266,0.000287868,0.001013051,0.2018983,0.6431072,0.1444458,0.0009530975,0.002189195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03179963,0.00005919453,0.9418415,0.0006755042,0.0006743452,0.0003013503,0.000006292953,0.001217518,0.02342463],"genre_scores_gemma":[0.6264232,0.000009879834,0.3728808,0.0002274339,0.0000417965,0.00001549897,0.00000158164,0.00001410729,0.0003857685],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6782966,"threshold_uncertainty_score":0.9999951,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01511389599807331,"score_gpt":0.2518160644528165,"score_spread":0.2367021684547432,"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."}}