{"id":"W1678216932","doi":"10.1109/isit.1993.748423","title":"Bidirectional Decoding of Convolutional Codes Over Rayleigh Fading Channels","year":2005,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Convolutional code; Decoding methods; Rayleigh fading; Viterbi decoder; Algorithm; Sequential decoding; Computer science; Viterbi algorithm; Binary symmetric channel; Fading; Iterative Viterbi decoding; Serial concatenated convolutional codes; Concatenated error correction code; Theoretical computer science; Block code; Low-density parity-check 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.0004603608,0.000291519,0.0002906016,0.0001700494,0.0002370874,0.0003194718,0.00024449,0.0003491143,0.0008248503],"category_scores_gemma":[0.002721306,0.0001233452,0.0001134063,0.0002889889,0.0003783429,0.0004641666,0.0002978559,0.0002524263,0.0002705573],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005467898,"about_ca_system_score_gemma":0.0007885792,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004009592,"about_ca_topic_score_gemma":0.005536835,"domain_scores_codex":[0.9997075,0.0001032554,0.00001304135,0.00002400611,0.00009532726,0.00005682759],"domain_scores_gemma":[0.998926,0.0005832473,0.0001086508,0.0001035911,0.0002566913,0.00002178277],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000268929,0.0000278677,0.002274201,0.0000725993,0.00002249493,0.0001237564,0.00008358025,0.8952499,0.02484719,0.02938275,0.0005118544,0.04713481],"study_design_scores_gemma":[0.00001059199,0.00004171047,0.0001743815,0.000004497189,0.000003872161,0.0000308723,0.000009249598,0.982235,0.01347496,0.003614496,0.0003957325,0.000004581408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5311455,0.0003781049,0.460041,0.0001546812,0.00002610262,0.00003249314,0.0001308527,0.0006622439,0.007429081],"genre_scores_gemma":[0.9571909,0.0001438236,0.04136704,0.00001766189,0.000003059168,0.00001718905,0.00005598776,0.00002237417,0.001181963],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004009592,"threshold_uncertainty_score":0.007972538,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02433493169666536,"score_gpt":0.2812361492869715,"score_spread":0.2569012175903062,"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."}}