{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001257651,0.001141697,0.0007137981,0.001308516,0.0008054103,0.001067711,0.001222756,0.000855979,0.00522942],"category_scores_gemma":[0.005468694,0.0005805505,0.0007359381,0.001127357,0.0007085442,0.001026878,0.001846283,0.001780743,0.004649707],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006013514,"about_ca_system_score_gemma":0.001949992,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001017768,"about_ca_topic_score_gemma":0.00163109,"domain_scores_codex":[0.9981823,0.0003348321,0.0002031847,0.0001976845,0.0009178875,0.0001640637],"domain_scores_gemma":[0.9975624,0.0007591677,0.0001749424,0.0005891489,0.0008342988,0.00007999859],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002612692,0.0001782471,0.0006780794,0.0004623216,0.00008478053,0.0004926482,0.0004924806,0.07595067,0.1109838,0.188993,0.008064323,0.6133584],"study_design_scores_gemma":[0.0001508697,0.0003337704,0.000611663,0.0001656685,0.00006148677,0.001441989,0.000117415,0.5364588,0.2469618,0.1651041,0.0483963,0.0001961559],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00138414,0.00006506824,0.9959987,0.00002711002,0.00001929865,0.00008593179,0.00006507357,0.0008557963,0.001498794],"genre_scores_gemma":[0.04491638,0.00025782,0.9509088,0.00006519532,0.00003267735,0.0005169103,0.0004498095,0.0003607239,0.002491697],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00522942,"threshold_uncertainty_score":0.01749414,"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."}}