{"id":"W1991079262","doi":"10.1109/tcomm.2003.815083","title":"Iterative threshold decoding without interleaving for convolutional self-doubly orthogonal codes","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"ca_institutions":"École de Technologie Supérieure; Polytechnique Montréal","funders":"","keywords":"Convolutional code; Serial concatenated convolutional codes; Decoding methods; Turbo code; Sequential decoding; Interleaving; Computer science; Algorithm; Encoder; Concatenated error correction code; List decoding; Error detection and correction; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005788753,0.0002262041,0.0002194528,0.0002722658,0.001184724,0.0001959525,0.001628867,0.00009965697,0.00001787645],"category_scores_gemma":[0.00003453874,0.0002445979,0.0001834075,0.000469249,0.0001304966,0.0006248386,0.00001614551,0.0004952279,0.00002296749],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002199902,"about_ca_system_score_gemma":0.0002116201,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001575894,"about_ca_topic_score_gemma":0.0003848471,"domain_scores_codex":[0.9984387,0.000219942,0.0004002882,0.0004034629,0.0002238632,0.0003137094],"domain_scores_gemma":[0.9966671,0.0009652773,0.0001492617,0.001772113,0.0003460108,0.0001002304],"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.00005643424,0.001949779,0.001323161,0.00006290019,0.0004018719,0.000002170518,0.00809087,0.003355707,0.006093236,0.9641067,0.001604709,0.01295242],"study_design_scores_gemma":[0.002010337,0.0006930105,0.0002725299,0.0005240787,0.0001711376,0.0002252701,0.0003943066,0.853051,0.0692034,0.04553733,0.02639043,0.001527141],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002582465,0.0001203436,0.991123,0.001051772,0.0004410338,0.0005518106,0.00003103659,0.001080757,0.003017731],"genre_scores_gemma":[0.619749,0.00005486182,0.379477,0.0001521377,0.000009240658,0.0003721422,0.00000360624,0.00001741086,0.0001646032],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9185694,"threshold_uncertainty_score":0.9974412,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05423382058004998,"score_gpt":0.323706578886975,"score_spread":0.269472758306925,"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."}}