{"id":"W2042649448","doi":"10.1109/tcomm.2011.100611.100171","title":"Efficient Search Algorithm for Determining Optimal R=1/2 Systematic Convolutional Self-Doubly Orthogonal Codes","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Convolutional code; Algorithm; Turbo code; Computer science; Serial concatenated convolutional codes; Mathematics; Concatenated error correction code; Block code; Decoding methods","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.0004491979,0.0005620841,0.0005221626,0.0007900267,0.000291272,0.0004359218,0.0006446796,0.0005580893,0.002725811],"category_scores_gemma":[0.002131337,0.0002625706,0.0002483878,0.0006310019,0.0003604002,0.0005636023,0.0006240464,0.000350609,0.0007582291],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003809348,"about_ca_system_score_gemma":0.001565135,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001405586,"about_ca_topic_score_gemma":0.002605477,"domain_scores_codex":[0.999751,0.00006913524,0.00002235706,0.00004104104,0.00008336025,0.00003302417],"domain_scores_gemma":[0.9994641,0.0003089439,0.00005850278,0.00004075845,0.0001125746,0.0000150704],"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.0003997075,0.0001401469,0.002236986,0.0002376955,0.00006703924,0.0001648509,0.0002291124,0.3606482,0.0256883,0.03489272,0.003595901,0.5716993],"study_design_scores_gemma":[0.00007617308,0.0000874961,0.000258347,0.00001802394,0.0000112601,0.00008855314,0.00003116894,0.9872349,0.004855057,0.006053405,0.001272491,0.00001316735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02208458,0.0001247677,0.9753755,0.00004829388,0.000009774793,0.00006103085,0.00005052446,0.0004473729,0.001798021],"genre_scores_gemma":[0.1536712,0.0001037299,0.8441793,0.00004990237,0.00001199152,0.0002356256,0.0002408756,0.00006809283,0.001439183],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002725811,"threshold_uncertainty_score":0.009118736,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05541220702480414,"score_gpt":0.2880105201604358,"score_spread":0.2325983131356317,"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."}}