{"id":"W4235436422","doi":"10.1109/tcomm.2013.011613.120145","title":"Efficient Parallel Search Algorithm for Determining Optimal R=1/2 Systematic Convolutional Self-Doubly Orthogonal Codes","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Convolutional code; Algorithm; Computer science; Turbo code; Concatenated error correction code; Linear code; Codec; Mathematics; Block code; Decoding methods; Telecommunications","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.00046922,0.0006065947,0.0005408994,0.0008975951,0.0003902148,0.0004863131,0.0007337788,0.0005102232,0.002704913],"category_scores_gemma":[0.001895049,0.0002830906,0.0002771222,0.0007720573,0.0004146274,0.000637539,0.0007131301,0.0003897389,0.0007226528],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004834261,"about_ca_system_score_gemma":0.002026915,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002246112,"about_ca_topic_score_gemma":0.003942522,"domain_scores_codex":[0.9997216,0.00005732776,0.00002424051,0.00005043173,0.0001121019,0.00003434148],"domain_scores_gemma":[0.9994624,0.0002642777,0.00006602043,0.00005534028,0.0001344663,0.00001750166],"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.0003455703,0.0001304483,0.00216342,0.0002483255,0.00007059581,0.0001799488,0.000216073,0.3468752,0.02606493,0.02787473,0.003037936,0.5927927],"study_design_scores_gemma":[0.00007929391,0.0000951145,0.0003163344,0.00001560497,0.00001361853,0.0001252364,0.0000306714,0.9851364,0.006124637,0.00635055,0.001697517,0.00001504791],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01936569,0.0001356659,0.9777044,0.00005109705,0.00001226989,0.00007311285,0.00004960541,0.0006099828,0.001998211],"genre_scores_gemma":[0.1472941,0.0001225875,0.8501405,0.0000514013,0.00001426162,0.0002705711,0.0002387121,0.00007504222,0.001792917],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002704913,"threshold_uncertainty_score":0.009048879,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02986627749641636,"score_gpt":0.2824168001553823,"score_spread":0.2525505226589659,"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."}}