{"id":"W2256656669","doi":"10.1109/9780470546345.ch11","title":"Matching Viterbi Decoders and Reed-Solomon Decoders in a Concatenated System","year":2009,"lang":"en","type":"book-chapter","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Viterbi decoder; Viterbi algorithm; Computer science; Soft output Viterbi algorithm; Convolutional code; Reed–Solomon error correction; Iterative Viterbi decoding; Matching (statistics); Concatenated error correction code; Speech recognition; Decoding methods; Algorithm; Mathematics; Sequential decoding; Statistics; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004902586,0.00067925,0.0005986037,0.0006987056,0.0005156755,0.001704971,0.001292286,0.001293396,0.01200827],"category_scores_gemma":[0.001734215,0.0007377192,0.0005724925,0.001478852,0.0006458477,0.00174387,0.0008357745,0.001263011,0.007782547],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001568193,"about_ca_system_score_gemma":0.001404519,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001727258,"about_ca_topic_score_gemma":0.00202168,"domain_scores_codex":[0.9993882,0.0001095574,0.00004041737,0.00011057,0.000297939,0.00005331584],"domain_scores_gemma":[0.9995875,0.0001747973,0.00002244038,0.00007920533,0.0001241724,0.00001196896],"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.0002182135,0.00007097696,0.0003656493,0.000511708,0.00008640692,0.0002491375,0.0005028422,0.09213977,0.02881981,0.4023433,0.0199997,0.4546925],"study_design_scores_gemma":[0.0000686755,0.0002366323,0.0005504148,0.0003052322,0.0001066534,0.000681829,0.0001034541,0.3960842,0.08848014,0.2225903,0.2906657,0.0001267521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0124389,0.00595829,0.8767179,0.000632877,0.000775673,0.0002334627,0.0002483698,0.002860972,0.1001336],"genre_scores_gemma":[0.1504996,0.006892408,0.5469033,0.0005415356,0.0004369627,0.000267671,0.000919238,0.0009364855,0.2926028],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01200827,"threshold_uncertainty_score":0.04017168,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01002445194920633,"score_gpt":0.203427533407889,"score_spread":0.1934030814586827,"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."}}