{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003856231,0.0001123918,0.0001509078,0.0002014885,0.0001048842,0.00004431572,0.0004674587,0.00005891533,0.0001639804],"category_scores_gemma":[0.00007778883,0.0001092553,0.00007868743,0.0003264809,0.00004589702,0.0005269003,0.0001857358,0.0001076975,0.00002577567],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001017295,"about_ca_system_score_gemma":0.00006210971,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006677286,"about_ca_topic_score_gemma":0.0000284215,"domain_scores_codex":[0.9989073,0.00003749796,0.0002565043,0.0002792558,0.0003017073,0.0002177954],"domain_scores_gemma":[0.9992504,0.000216104,0.0001089977,0.0002457632,0.0001246299,0.00005417218],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002146578,0.0003085984,0.02377292,0.00004008927,0.00009724338,0.000006375009,0.001623254,0.004399527,0.09503692,0.7937838,0.02279361,0.05811625],"study_design_scores_gemma":[0.0003754419,0.00008824209,0.00531645,0.00008638358,0.00000751244,0.00008069185,0.00002453663,0.5384965,0.4386872,0.00830188,0.008111139,0.0004240177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1144616,0.00009005082,0.870365,0.0004413977,0.0005518952,0.00009610907,0.000001766027,0.000765997,0.01322626],"genre_scores_gemma":[0.7930035,0.000006782838,0.2059896,0.0001599825,0.0001371547,0.000008282987,9.254701e-7,0.000006318752,0.0006875165],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7854819,"threshold_uncertainty_score":0.44553,"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."}}