{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000381323,0.0003123179,0.0003118912,0.0004713112,0.000297846,0.0005932158,0.0005252373,0.0004103178,0.0005831345],"category_scores_gemma":[0.002154506,0.0001444668,0.0002352242,0.0005988129,0.0004668412,0.0008922453,0.0005617708,0.0004829425,0.0003302368],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004042552,"about_ca_system_score_gemma":0.0009175757,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008944601,"about_ca_topic_score_gemma":0.001265843,"domain_scores_codex":[0.9995145,0.00006368294,0.00004431504,0.00004843824,0.0002745294,0.00005457402],"domain_scores_gemma":[0.9991141,0.0003058831,0.0001179756,0.0001727515,0.0002547481,0.00003444419],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000461974,0.00007488998,0.002113469,0.0002774771,0.00006781631,0.0004234399,0.0003485501,0.1656966,0.2241562,0.1848372,0.002639713,0.4189026],"study_design_scores_gemma":[0.00002393321,0.0001610524,0.0003515977,0.00002782464,0.00002636095,0.0004869771,0.00001944057,0.8406675,0.1318059,0.02138991,0.005004996,0.00003445844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03429289,0.0004188123,0.9624401,0.00006410419,0.00005320149,0.0000277003,0.00003676114,0.0003865929,0.002279842],"genre_scores_gemma":[0.6439759,0.0007678028,0.3500096,0.00007878727,0.00006287749,0.00006531762,0.0001762387,0.0001222618,0.004741336],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0008944601,"threshold_uncertainty_score":0.002933085,"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."}}