{"id":"W2154004095","doi":"10.1109/icc.2006.254906","title":"Procedures for Efficient Iterative Decoding of Orthogonal Convolutional Codes","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","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; Sequential decoding; Decoding methods; Concatenation (mathematics); Computer science; List decoding; Algorithm; Serial concatenated convolutional codes; Belief propagation; Concatenated error correction code; Berlekamp–Welch algorithm; Interleaving; Theoretical computer science; Mathematics; Block code; Arithmetic","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.0003306915,0.0001556642,0.0001702014,0.0002524157,0.0002899031,0.0001462139,0.002344042,0.00006419231,0.00002339753],"category_scores_gemma":[0.000181329,0.0001588715,0.0001060752,0.0002089889,0.0002403303,0.0001901027,0.0002335443,0.0001743787,0.00001133496],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001178433,"about_ca_system_score_gemma":0.0003546723,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009212639,"about_ca_topic_score_gemma":0.0003704456,"domain_scores_codex":[0.9986224,0.00008330554,0.0004545123,0.0002937466,0.0003644475,0.0001815935],"domain_scores_gemma":[0.9970894,0.0005915834,0.0003227376,0.0008103917,0.00114994,0.00003598749],"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.00001589613,0.0002735754,0.0008018076,0.000009735384,0.00002175758,2.681719e-7,0.0001758376,0.001145813,0.005259906,0.9894623,0.001987873,0.0008452192],"study_design_scores_gemma":[0.0005098113,0.0001554677,0.003510954,0.0003362902,0.0000117057,0.00001652793,0.00006504245,0.9009759,0.01825931,0.07370663,0.002110005,0.0003423869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02188684,0.00008258759,0.9337396,0.004489966,0.0004728922,0.000503932,0.0002292297,0.0002870478,0.03830792],"genre_scores_gemma":[0.8640222,0.00001849322,0.1351775,0.0001137768,0.00005536637,0.000196326,0.00008749348,0.000008986241,0.0003198712],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9157557,"threshold_uncertainty_score":0.6478591,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08670520343720678,"score_gpt":0.366594295161755,"score_spread":0.2798890917245482,"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."}}